Assuming A = {1, 7, 9, 15, 25, 44, 60, 75, 99, 115), construct a tabular trace for each of the following binary searches as done in class. The first line of each tabular trace must be "first last mid A[mid] return". Each subsequent line must have integer values appropriately aligned under the labels from the first line (feel free to use the table feature in the textbox below, but you don't have to). You can use the pseudocode for binary search below as a reference. a) binary Search(A, 9, 0, 9) b) binarySearch(A, 23, 0,9) binarySearch(A, key, first, last) if first > last return -1 mid = (first + last)/2 if A[mid] == key return mid if A[mid] last return -1 mid = (first + last)/2 if A[mid] == key return mid if A[mid]