CS$2340\mathrm{.}002$ Programming Project $2(6\%)$

Due $11$:$59$pm$,$ March $27,2024$

DESCRIPTION

Write a "merge" program that merges two ordered lists of integers into a new ordered

list. For example, given two ordered lists $(1,4,6,9)$ and $(0,2,3,7)$ as input arguments,

"merge" should generate a new list $(0,1,2,3,4,6,7,9)$ which is also ordered. Another

example is to merge $(-3,0,6)$ and $(-2,0,4,5,9)$ to produce $(-3,-2,0,0,4,5,6,9).$ You

may assume the number of integers in each list is known.

The "merge" program assumes that the two input lists $($in increasing order$)$ of integers

are stored in the data area. The program loads the integers and merges them into an

ordered list. The resulting ordered list $($for example, $(-3,-2,0,0,4,5,6,9))$ should be

stored back to the data area. You can choose how the data areas $($i$.$e$.,$ the lists$)$ are

arranged, and whether the resulting list is overwritten onto the original two lists. But be

sure to provide meaningful labels and clearly indicate $($either using labels or comments$)$

where the merged list is stored. Before your program terminates, it should print out the

merged list of integers $($comma or space separated$)$ which should be in ascending order. MIPS