Suppose that n ≥ 2, A = {a1,...,an} = B, and the channel respects a1,..., an-1 perfectly. Suppose that, when an is sent, the output characters a1,..., an are equally likely to be received. Find the optimal input frequencies and the capacity of this channel.