Q$3$: Sorted merge. Suppose you are given two lists L$1$ and L$2$ whose elements are integers that are sorted in non$-$

decreasing order. Write a function that admits L$1$ and L$2$ as inputs and merges them into a new list L whose

elements are still sorted in non$-$decreasing order.