The greedy part of the Huffman encoding algorithm is to first find two nodes with smallest frequency? (A) True (B) False (C) NA (D) NAâ–ºCorrect Option Correct Option is: A