In all the following Divide and Conquer algorithms, you must divide your problem into two (almost) equal subproblems. 3) Without sorting, Write the pseudocode for a Divide and Conquer algorithm to...

Extracted text: In all the following Divide and Conquer algorithms, you must divide your problem into two (almost) equal subproblems. 3) Without sorting, Write the pseudocode for a Divide and Conquer algorithm to find the largest element in a list L of size n. Then write the Recurrence Relation for the algorithm, and solve it to find the time complexity in 0 notation. Have you improved on the linear algorithm to find the largest element?