Huffman algorithm uses a greedy approach to generate an antefix code T that minimizes the expected length B (T) of the encoded string? (A) True (B) False (C) NA (D) NAâ–ºCorrect Option Correct Option is: A