python

# Question 5: Given two sorted lists, it is possible to merge them into one sorted lists in an efficient way. Design and implement a divide and conquer algorithm to merge two sorted lists. def merge(list1, list2): # Provide your code here print "merge([1, 3, 5, 7], [2, 4, 6, 8]):\t", merge([1, 3, 5, 7], [2, 4, 6, 8]) # should return [1, 2, 3, 4, 5, 6, 7, 8]