UN Computer Science Frank Nielsen (Auth) Introduction to HD adita-0.9.10 A A A O OTO 1 5-5. For each of the following problems: design a greedy algorithm that solves the problem; de- scribe your algorithm with clear pseudocode; and prove the time efficiency class of your algorithm maximum problem (a) input: a non-empty sequence S of n orderable objects output: the greatest (maximum) element in S list reversal (b) input: a list L of n elements output: a list containing the elements of L but in reversed order 5-6. For each of the following summation expressions, either simplify the expression using the rectangular sum formula, or explain why the formula is not applicable. 148 UN Computer Science Frank Nielsen (Auth) Introduction to HD adita-0.9.10 A A A O OTO 1 5-5. For each of the following problems: design a greedy algorithm that solves the problem; de- scribe your algorithm with clear pseudocode; and prove the time efficiency class of your algorithm maximum problem (a) input: a non-empty sequence S of n orderable objects output: the greatest (maximum) element in S list reversal (b) input: a list L of n elements output: a list containing the elements of L but in reversed order 5-6. For each of the following summation expressions, either simplify the expression using the rectangular sum formula, or explain why the formula is not applicable. 148