Using divide and conquer, design an algorithm that determines the first and the second largest element in an array of 2 n elements. (4 pts) Give a recursion formula for the runtime of the algorithm. (2 pts) Give the complexity of your algorithms (2 pts). (2 pts if your algorithm is linear.) (Hint: Divide the array into two equal halves.)