Answered You can hire a professional tutor to get the answer.

# Suppose T is not found by Binary Search #2; then, in the last comparison, A[ p] T. (a) Show that if 1 lt; p lt; n, then A[ p 1] lt; T lt; A[ p]....

(b) Show that if 1 = p < n, then T < A[ 1].

(c) Show that if 1 < p = n, then A[ n − 1] < T < A[ n] or A[ n] < T