Can someone guide me on this problem ?

Use the divide and conquer approach to design an algorithm that finds both the largest and the smallest elements in an array of n integers. Show that your algorithm does at most roughly 1.5n comparisions of the elements. Assume n = 2^k.