Consider the following binary search code, copied from Wikipedia. Is it correct? function binary_search(A, n, T): L := 0 R := n − 1 while L <= R: m := floor((L + R) / 2) if A[m] < T: L := m + 1 else if A[m] > T: R := m - 1 else: return m return unsuccessful How sure are you? When I see this code, I have to ask myself: What’s up with all of these ‘s? What happens on small arrays? What happens if th