A discrete memoryless source generates messages m$1,$m$2,$m$3$ with probabilities p$($m$1)=1/2,$ p$($m$2)=$p$($m$3)=1/4.$ Design a Huffman code based on the alphabet A$=(0,1,2)$ for nine possible message pairs consisting of these messages. Show whether the code is absolute optimum.