Using FIFO priority queue to produce predictable results, using FIFO for each frequency

Provide the frequency and the Huffman encoding for each character in the following string: Provide the frequency and encoding for each character in the string. Insert the letters and their frequencies into the priority queue in the alphabetic order below, with blank first. When a node with the same frequency is inserted in the priority queue, it is placed after other nodes with the same frequency already in the priority queue. Refer to algorithm 3.4.1. Encode the resulting graph with the left child as 0 and the right child as 1