Heap priority queue and Huffman Code

Complete a Heap priority queue $6,22,14,13,8,30,1,4.$ Show all your drawings, step by step Every time you add a new node draw a different drawing.

Use Huffman coding to encode these symbols with given frequencies: $a$:$20,b$:$10,c$ : $15,$ d: $25,$ and e: $30.$ Create the Huffman Code binary tree and the Huffman table that represents the binary code for each character. Show all your drawings, step by step the Huffman Code tree.