Suppose that a list of nine items, (r(l),r(2),...,r(9)), is sorted by key in decending order so that r(3).key = 12 and r(4).key = 10. List the executions of the BinarySearch algorithms that would be needed to complete BinarySearch(1,9) when:________.
(a) The search key is C = 12
(b) The search key is C = 11