(a). Given the following sentence: what why where when (1) Build the Huffman tree for the above sentence. Sort the characters from left to right based on the frequency of occurrence first and then alphabetically. In case of combining two letters, the left child of each parent node should have a lower or equal frequency than the right child. Assume that the whitespace character is smaller than any alphabets. [10 marks] (ii) Based on part (b)i), provide the Huffman code for each letter and encode the whole message above. [5 marks] (b). Build a complete tree based on the array presented in Figure 1. Clarify if the tree has a min-heap property (Fix if not min-heap). Illustrate how to extract the Min() three values one by one from the heap tree, producing a frame by frame trace. [10 marks) 2 2 4 15 9 9 11 16 40 20 20 Figure 1. Array