Question 7 (a) Show how to find the largest and the smallest among four integers using four comparisons between integers, that is, four comparisons each of which involves just two integers. (b) Hence design a divide-and-conquer algorithm that finds the largest and the smallest among n integers using at most 3n/2 2 comparisons between integers, where n > 2 is a power of 2. Justify your answer using induction on k > 1 where n =