elect all of the following properties $($good and bad$)$ that an arithmetic coder has but an extended Huffman coder does not have.

Group of answer choices

The tightest upper bound on average bits$/$symbol

The ability to adapt the probability model dynamically as source symbols are encoded

The $($theoretical$)$ ability to losslessly encode the source at the entropy rate in the limit as the number of symbols encoded together goes to infinity

The ability to separate the probability model of the source from the encoding mechanism

The "effective" block size automatically increases as more source symbols are encoded

The ability to allocate fractional numbers of bits$/$symbol