Recall that in the Ski-Rental problem, b E N is the cost of buying and 1 is the cost of renting. Consider the following randomized algorithm. Rent skis for the first b - 1 days. For each following day, flip a p-biased coin (p [0, 1] is the probability of heads and 1 p is the probability of tails): if the coin comes up heads, buy the skis, otherwise continue renting. Of course, if you decide to buy on a particular day you don't make a decision on the following days. What is the expected competitive ratio of this algorithm against oblivious adversary? Prove your answer. Your answer should be expressed in terms of p