2. (25) [Divide and conquer: local minimum node] Textbook Exercise 6 in Chapter 5. Assume each node in the input tree has two links: lchild and rchild. (1) Write a recursive algorithm LocalMin using divide-and-conquer, and (2) write a recurrence relation that expresses the run time T(n) (n: number of nodes in the input tree) and then (3) solve the recurrence relation to derive Tn) O(log n) using telescoping; there is no need to provide a formal proof of O(log n) . When writing the algorithm, you can simplify the expression by writing "v