For each of the following problems, design a greedy algorithm that solves the problem. Describe your algorithm with clear pseudocode and prove the time efficiency class of your algorithm. (a) offline ski rental input: a daily ski rental price r > 0, purchase price p > 0, and number of days d>0 output: True if it is cheaper to rent skis for d days at r dollars per day, or False if it is cheaper to buy skis for p dollars (b) list reversal input: a list L of n elements output: a list containing the elements of L but in reversed order
