Draw the flowchart of the Huffman coding algorithm. The first flowchart will read the string and create a sequence of ordered frequencies, the second will encode the sequence. Indicate the steps of the coding tree on the flowchart.

$1.$Sort the characters from smallest to largest in order of frequency of occurrence in the text.

$2.$Group the two smallest characters, add their frequencies, and re$-$enter the order.

$3.$Continue grouping until only one group remains.