Write a function merge(lst1, lst2) that takes two sorted lists as arguments, and returns the elements of both lists, merged. This function must have a complexity of O(n + m) where n list the length of lst1 and m is the length of lst2. Input as two sorted lists lst1, lst2 like 1,merge([1, 2, 4, 6], [3, 5, 7, 8]) 2,merge([1, 2, 3], [4, 5, 6])
output:One sorted list 'res' merged together 1,[1, 2, 3, 4, 5, 6, 7, 8] 2,[1, 2, 3, 4, 5, 6]