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