For these characters and frequencies

a d e g k b

1 2 4 4 8 10

please make a binary tree with each node labeled and 0 or 1 on each branch as appropriate. Then make a table of characters and their codes. Please also calculate the total number of bit used. Then calculate the bits used if we didn't use Huffman coding but instead used 3 bits for each character. Please submit a good scan