Entropy, Optimal Codes and Huffman Trees Consider the following probability distribution over the symbols in a file, and select the SINGLE best answer. Symbol Frequency 0.2 0.2 A) An optimal encoding of these symbols under the distribution above : is be a fixed-length encoding Is a variable-length encoding Could be either a fixed-length or a variable-length encoding B) The entropy of this distribution over these symbols is As large as possible As small as possible iii) Neither as large nor as small as possible C) Choose the single statement below that is true about these symbols under this distribution: There is exactly one optimal encoding for this distribution There is more than one optimal encoding for this distribution, but all optimal encodings will have the same expected code length per symbol. There is more than one optimal encoding for this distribution, and different optimal encodings can product different expected code lengths per symbol. D) Choose the single statement below that is true about these symbols under this distribution: An optimal encoding will result in an expected code length per symbol that is small than the entropy of this distribution. An optimal encoding will result in an expected code length per symbol that is equal to the entropy of this distribution. An optimal encoding will result in an expected code length per symbol that is greater than the entropy of this distribution