Consider a code that satisfies the suffix condition: No codeword is a suffix of any other codeword. (i) Is this a uniquely decodable code? Why? (ii) Can you relate the minimum average length of Suffix codes to the average length of the Huffman code for the same random variable? Explain.