Define a suffix-free code as a code in which no code word is a suffix of any other code word.
(a) Show that suffix-free codes are uniquely decodable. Use the definition of unique decodability in Section 2.3.1, rather than the intuitive but vague idea of decodability with initial synchronization
(b) Find an example of a suffix-free code with code word lengths (1, 2, 2) that is not a prefix-free code. Can a code word be decoded as soon as its last bit arrives at the decoder? Show that a decoder might have to wait for an arbitrarily long time before decoding (this is why a careful definition of unique decodability is required).
(c) Is there a code with code word lengths (1, 2, 2) that is both prefix-free and suffix-free? Explain your answer