Each of the following snippets of pseudocode fails to live up to all of the clarity, correctness, and termination requirements of algorithms.

In each case, describe the problem, and then rewrite the pseudocode as a proper algorithm. Thank you!

(c) for list: total = total + i (d) def long_division(numerator, denominator) : quotient = numerator // denominator remainder = numerator % denominator (e) def does_alternate_01(S): i = 0 while i