Exercise 2: (5+5=10 points) Referring back to the searching problem (see Exercise 3 in Homework 1), observe that if the sequence A is sorted, we can check the midpoint of the sequence against v and eliminate half of the sequence from further consideration. The binary search algorithm repeats this procedure, halving the size of the remaining portion of the sequence each time. Question 2.1: Write the pseudocode of a recursive function for implementing the binary search algorithm. Question 2.2: What is its worst-case running time