How many bits are needed for standard encoding if the size of the character set is X?
(a) log X
(b) X+1
(c) 2X
(d) X^2
The question was posed to me in an online interview.
Origin of the question is Greedy Algorithms in section Greedy Algorithms of Data Structures & Algorithms II