solve

Here is the pseudocode for a modified version of Binary Search. Take some time to understand the modification. function binarysearch (A , TARGET) L = 0 R = n-1 i = 0 while L A[C[i]] L = C[i]+1 end if end while return FAIL end function (a) Suppose we call binarysearch on a list of length 8 containing all distinct elements and with the TARGET equal to A [O]. What values will the print (C[i] ) statement output? You will not need all the spaces below. (b) Suppose we call binarysearch on a list of length 2" with k 2 1. Write down an expression for c[i]