In Huffman coding, the algorithm repeatedly picks two nodes and merges those. These two nodes are:

In Huffman coding, the algorithm repeatedly picks two nodes and merges those. These two nodes are:

1. a) with the highest frequency
2. b) with the lowest frequency
3. c) one highest and one lowest frequency
4. d) picked arbitrarily