$(11$ points$)$ Describe an inductive algorithm design strategy for finding both the minimum and maximum of n numbers using fewer than $3$n$/2$ comparisons and develop the corresponding recursive algorithm. Prove that your solution requires less than $3$n$/2$ comparisons using the recursion tree method.