Write a divide and conquer algorithm that reverses the order of the elements of a list. def reverse_dc(lst): II II|| Return a list with the reverse order of the elements of lst. >>>...

Need some help, confused about this

Extracted text: Write a divide and conquer algorithm that reverses the order of the elements of a list. def reverse_dc(lst): II II|| Return a list with the reverse order of the elements of lst. >>> reverse_dc([1,2,3,4]) [4,3,2,1] II I| || 1. What is the run time? Justify your answer. You may assume list slicing and list concatenation both take constant time. 2. What can you use to measure the size of recursive calls? 3. Prove the correctness of your solution.