Solve the problems using python, also show the simulation.

Q$.$

Huffman Coding: The Messenger's Code

Problem $3$: The Kingdom of Huffia

The kingdom's messengers need an efficient way to encode their messages to

minimize the risk of interception. Help them create the most efficient encoding

scheme.

B: $13$

D: $16$

A: $45$

C: $12$

E: $9$

G: $3$

Construct the Huffman tree for the frequencies above and determine the op$-$

timal binary codes for each letter.