We have a string $B=$

kkkffffffffmkkkkkrrrrfffypffmppppfppmy

The frequency of each character within the string has already been counted in Table $1$:

Table $1$: Frequency of each character in the string B$.$

Using the Huffman$($B$)$ greedy algorithm discussed in this module and in the required reading,

compress string B to calculate the encoding for the following characters:

$r=$

$m=$

$y=$

$k=$

$f=$

In this exercise, we assume that an edge connecting an internal node with its children is

labelled $0$ if it is an edge to a left child, and $1$ if it is an edge to a right child.