Given an array s = hs[1], s[2], . . . , s[n]i, and n = 2d for some d 1. We want to find the minimum and maximum values in s. We do this by comparing elements of s

Write a recurrence relation for T(n) where T(n)= the number of comparisons your algorithm makes. Show that your recurrence relation has as its solution T(n) = 3n/2 - 2