Find a Huffman tree with lengths $l_1,l_2,$dots,$l_n$ for the items.

Sort the items in ascending order according to their lengths.

The codeword $c_i$ is the first $l_i$ bits after the binary point of ${\displaystyle \underset{j=1}{\overset{i-1}{}}}{2}^{-l_j}$

A$.)$ Create a Canonical Huffman Decoding $,$with the new algorithem,

alphbet $=\{$ a$,$b$,$c$,$d$,$e$,$f$,$g$,$h$,$i$\},$the incidences foe each symbol $[7,21,9,6,5,11,4,7,3].$ a:$7,$ b:$21,...,$i:$3.$

B$.)$ what is the identical and what the differences from the Orginial Canonical algorithm decoding $,$from the new one $?($depending the result from question A$).$ Sulotion with steps not only Explenation and defnition,please.