6. Construct the Hoffman code for the C++ keywords given below for which the expected length of the bit string for each keyword is minimal. The weights of the keywords are given below in the table. int Words Weights float 1.35 .3 for return 1.1 switch .1 if .05 Draw resulting binary tre Answer: Write the Hoffman codes for all the words. .3 Words Weights Hoffman Code float .35 int for .1 return .1 switch .1 if .05 7. Give the binary-tree representation of the following trees in the forest. (Join these three trees in the forest to form a binary tree.) K CD LM BEF P