Huffman Coding algorithm is a greedy algorithm because:
A.
The algorithm always picks a single symbol with the largest frequency of occurrence
B.
The algorithm always picks a pair of symbols that are most similar
C.
The algorithm always picks a pair of symbols with the smallest frequencies
D.
None of the options given