$11.$ a$)$ Compute Golomb code G$3($n$)$ for $0<=$ n$<=15$

b$)$ Design procedure for decoding Golomb code Gm $($n$).$

c$)$ Why is it not possible to compute the Huffman code of the nonnegative integers, n $>=0,$ with the

probability mass function?

d$)$ Compute exponential Golomb code G$2$

exp$($n$)$ for $0<=$ n$<=15$