6. a) [12ps] Design an efficient algorithm for computing the largest and second largest element in a list. b) [8pts] Analyze the computing time of your algorithm. Hint. Base your algorithm on a single-elimination tournament, where the winner is the largest element and observe that the second largest element only loses to the largest. Also observe that the number of rounds in a single elimination tournament with n players is log2n