public static int binarySearch( int key, int[] a ) { int low = 0; int high a. length-1; while ( low a[mid]) low = mid+1; else return mid; return -1; } Trace the binary search for the value 43 by updating the variables low, high, and mid for each iteration of the loop, then provide the return value. 1 2 5 6 3 25 4 33 7 53 8 64 9 72 10 84 11 12 13 93 95 96 14 97 13 43 14 A[i] 6 51 Iteration low high mid AM Iteration 1: AM Iteration 2: P AV Iteration 3: Return