(c) The following pseudocode subroutine merges two sorted lists of equal or unequal lengths. It
is called with the two lists shown in the main program.
NOTE: Given that list1 = [1, 2, 5, 10], then list1[1:] = [2, 5, 10].
That is, it returns a sublist starting with list1[1].
1. SUB merge (list1,list2)
###The code bellow is for when there is an empty list###
2. IF length(list1) = 0 and length(list2) = 0
3. return []
4. ENDIF
5. IF length (list1) = 0
6. return list2
7. ENDIF
8. IF length (list2) = 0
9. return list1
10. ENDIF
###if first value of list1 is less than first value of list
2 then
Return (list 1’s first index and the truncated version
(remove first index) of list 1 and full of list 2)
Then since it calls the function merge inside the function
merge (recursive function)
You then take your return output and start from the begging
of the function###
11. IF list1[0] <= list2[0]
12. return [list1[0]] + merge(list1[1:], list2)
13. ENDIF
