Huffman problem.

a$.$ Draw the Huffman prefix code Tree for following set of characters along with their frequencies. a: $8\%,b$:$20\%,c$:$26\%,d$:$11\%,e$:$14\%,f$:$7\%,g$:$13\%$

b$.$ Translate string "babdcecgbcdefg" with the prefix code you design in a$),$ count how many bits you need for this sting. $($compare to fixed$-$length code with $3$ bits for each character$)$