Add Merge two sorted lists

[kshitigambhir]

[kshitigambhir]

@xthxr pls assign

[d-mahi14]

Goal: Write a function that merges two given sorted lists (or arrays) of integers into a single new list, which must also be sorted.

Input:

list1: A sorted list of integers (e.g., [1, 3, 5]).
list2: A sorted list of integers (e.g., [2, 4, 6, 8]).

Output:
A new list containing all elements from both list1 and list2, sorted in non-decreasing order (e.g., [1, 2, 3, 4, 5, 6, 8]).

Constraints & Requirements:
The function must return a new list; the original input lists should not be modified.
The merging process should be done in a single pass to achieve an optimal time complexity of O(n+m), where n is the length of list1 and m is the length of `list2$. You should not use built-in sort functions on the combined list.

Example:
Input: list1 = [1, 2, 4], list2 = [1, 3, 4]
Output: [1, 1, 2, 3, 4, 4]

is this issue open...can you assign it to me?
@xthxr