Foundations of Algorithms. please answer both of this queations in detail please and thank you.

4. Show that the worst-case time complexity for Binary Search (Algorithm 2.1) is given by W(n)=[lgn]+1 when n is not restricted to being a power of 2. Hint: First show that the recurrence equation for W(n) is given by W(n)=1+W(2n)forn>1W(1)=1. To do this, consider even and odd values of n separately. Then use induction to solve the recurrence equation. Show that the recurrence equation for the worst-case time complexity for Mergesort (Algorithms 2.2 and 2.4) is given by W(n)=W(2n)+W(2n)+n1 when n is not restricted to being a power of 2