Question is incomplete . In this we need an additional field as follows
Now according to Huffman coding algorithem
A data file of 100,000 characters contains only the characters g-l , with the frequencies indicated. If we assign each character a 3-bit codeword, we can encode the le in 300,000 bits. Using the variablelength code shown, we can encode the fi le in only 224,000 bits.
A vertex cover of an undirected graph G(V, E) is a subset V1⊆ V vertices such that