7. Identify the basic operation and construct a recurrence relation C(n) that characterizes the time complexity of the algorithm in i) the best case (i.e., Chest(n)) and ii) in the worst case (i.e., Cworst(n)). Use the Master Theorem as determine the order of growth of Chest(n) and Cworst(n) using 2. Hint: The size of the input n = max - min Foo7 (m, min, max) // Description: ... // Input: integers m, min and max // Output: ... if max - min