(1) a) What is 2:2; (3/4)?? b) What is the Li-2 i(3/4)?? (2) A coin has 1/4 chance of having heads, 3/4 chance of having tails. It is tossed n. times. a) What is the expected number of coin tosses needed to get a heads? b) What is the probability that the number of heads equals the number of tails? Write the expression using () notation, and then see if you can approximate what this gives. (3) If we change the randomized QUICKSORT algorithm so that it repeatedly ran- domly selects a pivot and runs PARTITION until it finds a good pivot like our SELECT does, and suppose we keep track of the pivots used so far so we never use one twice for the same array, what is the worst case cost of the algorithm? Give a recurrence for this and its asymptotic solution (you can use the master method.)