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.

$\backslash$table$[[$Keywords$,$Weights$],[$return$,\mathrm{.}2],[$switch$,\mathrm{.}15],[$while$,\mathrm{.}1],[$if$,\mathrm{.}3],[$for$,\mathrm{.}25]]$

i$)$ Draw resulting binary tree.

ii$)$ Write the Hoffman codes for the keywords in this table.

$\backslash$table$[[$Keywords$,$Weights,Codes$],[$return$,\mathrm{.}2,],[$switch$,\mathrm{.}15,],[$while$,\mathrm{.}1,],[$if$,\mathrm{.}3,],[$for$,\mathrm{.}25,]]$