Consider a conventional Huffman code that encodes a source which outputs $6$ possible symbols with codewords ranging in length from $1$ to $4$ bits.

If a single bit in the compressed bitstream is corrupted, how many source symbols after that bit error will be corrupted?

Select all that apply

Group of answer choices

$1$

$4$

$5$

All of the symbols decoded after the corrupted bit is encountered

We can't say: it depends on exactly which bit in the sequence was corrupted

$3$

We can't say: it depends on the actual code

$6$

$2$