<s>[INST] You can use any programming language you'd like to find the solution. I'd prefer Python.

You have two lists of integers: nums1 and nums2. The lengths of both lists are > 0 and are less than or equal to 1000. The lists are guaranteed to only contain non-negative integers. 

The goal is to return a new list that contains the maximum number of elements from both lists such that the resulting list is sorted in ascending order. 

Example:
nums1 = [1, 3, 5]
nums2 = [2, 4, 6]
Output: [1, 2, 3, 4, 5, 6]

Example:
nums1 = [1, 2, 3]
nums2 = [4, 5, 6]
Output: [1, 2, 3, 4, 5, 6]

Example:
nums1 = [1, 1]
nums2 = [2, 2]
Output: [1, 1, 2, 2]

Example:
nums1 = [0, 0]
nums2 = [1, 2]
Output: [0, 0, 1, 2]

Example:
nums1 = [1, 3, 5, 7, 9]
nums2 = [0, 2, 4, 6, 8]
Output: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

You can solve this problem using only 1 loop.

Here's a starter file in Python with the signature of the function you're solving.

```
def merge_sorted_lists(nums1, nums2):
    pass
```
What is the solution to this problem using 1 loop?[/INST]