Acompression scheme for long strings of bits called run-length encoding is described as follows: rather than record each 0 and 1 individually, instead record "runs" of bits by storing the number of consecutive 1s and 0s that appear. since it's binary, any run of 0s must be followed by a run of 1s (even if the run is only 1-bit long) and vice versa. thus, you can store a list of small numbers that represents the alternating runs of 0s and 1s. here is an example: to uncompress the data back into its original binary state, you simply reverse the process. this technique is an example of what type of compression?
(a) lossy compression
(b) lossless compression
(c)fast fourier transform compression
(d)tailored compression

Multiple choice project create a program with two multiple choice questions. 1. users have two attempts only, show attempt number each time. hint: while loop with break control. (20%) 2. only one correct answer for each question, use switch case for each question. (20%) 3. show total score after the two questions are answered. hint: . (20%) 4. user have options to answer the two questions again if first attempt score is not 100%. hint: if statment. (20%) 5. use string method .toupper() to allow users to enter with lowercase or uppercase letters. (20%) 1. where is the capital of the state of florida? a. orlando b. tallahassee c. miami d. tampa b 2. where is walt disney world park located in florida? a. orlando b. tallahassee c. miami d. tampa a