(coding question) Using the algorithm below, write a function merge (s1,s2) that merges two sorted lists into a single sorted list.

Explain how you solved the problem (the algorithm) briefly.

DIVIDE AND CONQUER EXAMPLE 2: MERGE SOR.T Algorithm mergeSor(S) Merge-sort on an input sequence S with n elements consists of three steps Input sequence S with n elements Dividde: partition > into two sequences >1 and So of about n/2 elements each Output sequence S sorted Conquer: recursively solve (sort) S, and S2 according to C . Combine: merge S, and S2 into a uni ue if S.size)> 1 sorted sequence (S, S)