A simple way of handling corruption is to encode m by repeating each symbol of message m a certain number of times.
(i) (1 point) Suppose the channel can introduce up to t erasures. How many times should we repeat each symbol in the message to ensure that we can recover the original message?
(ii) (1 point) Repeat the previous problem, now assuming the channel can introduce up to t errors.