(3) Write up the proof that finding the smallest and next to smallest element can be done with no more than n+ [lg n] 2 comparisons. Why is the ceiling used there? (4) If a monkey types a sequence of 1000 letters from {a,b,c,...,Z} , what is the expected number of times "snowstorm will occur as a contiguous subsequence? (5) Letl X[1..n) and Y [1..n] be two arrays each containing n numbers already sorted. Give an O(log n) time algorithm to find the median of all 2n elements in X andY