Crabbe and Goyle are now arguing about binary search. Goyle writes the following pseudocode on the board, which he claims implements a binary search for a target value v within input array A containing n elements. bSearch(A, v) {return binarySearch(A, 0, n, v)} binarySearch(A, 1, r, v) {if 1 >= r then return -1 p = floor((1 + r)/2) if A[p] == v then return m if A[m]