Problem 2 (4 points) Convert each of the following sequences of bits into the first 4-bit run-length encoding scheme presented in lecture. (The one where the first bit of each sequence indicates whether it's a run of Os or 1s and the other three bits indicate the length of the run.) SHOW YOUR WORK. For each, give the compression ratio - the number of bits in the uncompressed representation divided by the number of bits in the compressed representation. A. 1111111000000011 B. 1111100000000000 C. 1010101010101010 We discussed a second 4-bit RLE scheme wherein all four bits are used to indicate the length of the run and it's simply assumed that the first run will be of Os, the second run will be of 1s, and so on, alternating. D. Give an example of a bit sequence which has a better compression ratio under this alternative scheme than the original scheme. Problem 2 (4 points) Convert each of the following sequences of bits into the first 4-bit run-length encoding scheme presented in lecture. (The one where the first bit of each sequence indicates whether it's a run of Os or 1s and the other three bits indicate the length of the run.) SHOW YOUR WORK. For each, give the compression ratio - the number of bits in the uncompressed representation divided by the number of bits in the compressed representation. A. 1111111000000011 B. 1111100000000000 C. 1010101010101010 We discussed a second 4-bit RLE scheme wherein all four bits are used to indicate the length of the run and it's simply assumed that the first run will be of Os, the second run will be of 1s, and so on, alternating. D. Give an example of a bit sequence which has a better compression ratio under this alternative scheme than the original scheme