Let us consider the optimal Huffman code tree T$1$ in the figure below. T$1$ has been constructed from file F$1$ containing only colons, spaces, newlines, commas, and digitsSelect one or more:a$.$ According to T$1,$ characters $"4"$ and $"5"$ are codded using the same number of bits$\mathrm{.}0$b$.$According to T$1,$ all the characters $($colons$,$ spaces, newlines, commas, and digits$)$ occur in F$1$ with the same frequency.C$.$T$1$ is constructed using a Greedy algorithm, and the criteria adopted is the frequency of occurrence of the characters in F$1.$ d$.$ A Greedy algorithm cannot be used to construct T$1$ from F$1.$ e$.$ According to T$1,$ comma $(*.*)$ is the most frequent character in F$1.$