You are given an unsorted array of n integers.

1) What is the time cost to find the maximum or minimum?

2) Assume the time cost to find each of the maximum and minimum is T(n). A straightforward way to find both of the maximum and minimum costs 2T(n). Please give a better approach using divide-andconquer. Describe the recurrence and solve it. You can assume n is power of 2.