I need help answering a few questions about Huffman Coding.

1. A Huffman Coding tree is always a full binary tree.

A. True

B. False

---------------------------------------------------------------

2. The least frequent symbol will have the shortest code using Huffman Coding.

A. True

B. False

---------------------------------------------------------------

3. Huffman Coding is

A. fixed-length coding

B. variable-length coding

C. both fixed and variable coding

D. non-predictable

---------------------------------------------------------------