SupposewehaveanoptimalprefixcodeonasetC Df0;1;:::;n 1gofcharac- ters and we wish to transmit this code using as few bits as possible. Show how to represent any optimal prefix code on C using only 2n 1 C n dlg ne bits. (Hint: Use 2n 1 bits to specify the structure of the tree, as discovered by a walk of the tree.)