Square Root (10 points) Given a natural number n, create an algorithm based on binary search to compute the square root of n (the biggest natural number k such that k2 2.) Give pseudo-code for your algorithm (that uses a loop) and explain how your algorithm works in English. Give a recurrence relation for your algorithm and solve it to compute a tight upper-bound for the amount of time that your algorithm takes as a function of n.).>