Problem $5.$

What is an optimal Huffman code for the set of frequencies in each of the

following cases $($specify the codes, or draw the corresponding binary trees$)?$

$($a$)a$:$1,b$:$1,c$:$2,d$:$3,e$:$5,f$:$8,g$:$13.$

$($b$)a$:$10,b$:$10,c$:$10,d$:$10,e$:$10,f$:$10,g$:$10.$