URGENT PLEASE

Q1: Consider an array a[] = { Abdullah, Butaina, George, Inam, Jim, kawther, kavin, Raba, Robin, Roza}. The name George (target) to be searched using the binary search algorithm given below. Trace the variables low, high, and mid to complete the task.

low	high	mid

Public int binarySearch(String[] a, String target) {

low=0 ; high=a.length-1

While (low <= high) {

int mid=(low+high)/2;

int com=target.compareTo(a[mid]);

if (com == 0)

return mid;

else if (com < 0)

high=mid-1;

else

low = mid+l;

}

return -1;

}

Q2: Given the function T(n) = n³ + 20n + 5, show that T(n) is O(n³)