Find an optimal prefix-free encoding (Huffman code) for texts in the alphabet shown below having the shown frequencies and sketch the corresponding rooted tree. Find the average encoding length of the...

Please help with the following:

*ASAP*

(WILL LEAVE A LIKE)

please sketch corresponding rooted tree as well

Extracted text: Find an optimal prefix-free encoding (Huffman code) for texts in the alphabet shown below having the shown frequencies and sketch the corresponding rooted tree. Find the average encoding length of the obtained code. Symbol Encoding Frequency A 0.25 0.22 C 0.2 D 0.14 E 0.1 F 0.09