Let a be a sorted (ascending) sequence of n unique integers, where n = 2 and b is a natural number. given a number k where a[1] sk 3 a[n]. : (a) [10 pts] develop a pseudo code that in the worst case takes o(log n) to find the index i where a[i] = k or output null if k is not in a. (b) [10 pts) show that the algorithm you developed in 3a indeed have the worst-case running time complexity of o(log n).