Consider the problem of finding the largest and second largest elements from a set of n elements. a) Give a simple iterative algorithm that takes no more than 2n 3 comparisons. b) Give a divide and conquer algorithm and show that it takes (3n/2) 2 comparisons when n is a power of 2. C)Show how you can find both these elements in n + log n 2 comparisons in the worst case (assume n is a power of 2).