Question 1 of 10
A student compresses the text AAAABBBAAABBBB using a run-length scheme that stores each run as (symbol, count). The compressed form is (A,4)(B,3)(A,3)(B,4).
Can the original 14-character string be restored exactly from that compressed form?
- A. Yes; every run length and symbol is preserved, so expansion rebuilds AAAABBBAAABBBB.
- B. No; run-length compression is always lossy.
- C. Yes, but only the letters A and B survive; the order of runs is lost.
- D. No; counts discard how many characters existed.