Suppose we have an optimal prefix code on a set C $=\{0,1,...,$ n $1\}$ of characters and we wishto transmit this code using as few bits as possible. Show how to represent any optimal prefix codeon C using only $2$n $1+$ nlog n bits. $($Hint: Use $2$n $1$ bits to specify the structure of the tree,as discovered by a walk of the tree.$)$ Please give proper answers