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).

Suppose s, t, and w are strings that have already been created inside main. write a statement or statements, to be added to main, that will determine if the lengths of the three strings are in order by length, smallest to largest. that is, your code should determine if s is strictly shorter than t, and if t is strictly shorter than w. if these conditions hold your code should print (the boolean value) true. if not, your code should print false. (strictly means: no ties) example: if s, t, and w are "cat", "hats", and "skies" your code should print true - their lengths are 3-4-5; but if s, t, and w are "cats" "shirt", and "trust", then print false - their lengths are 4-5-5 enter your code in the box below