Error-correcting codes and the probability of transmitting a message without errors

(a) a communication channel flips each transmitted bit with probability 0.02. the event that one bit is flipped is independent of the event that any other subset of the bits is flipped.

a 100-bit message is sent across the communication channel and an error-correcting scheme is used that can correct up to three errors but expands the length of the message to 110 bits. what is the probability that there is an error in the message after the message has been transmitted?

umumumumum

im not sure

b: |12 – x| ≤ 0.25

step-by-step explanation:      

let x be the possible lengths in inches, of the ribbons jaime cut.

we have been given that jaime is cutting strips of ribbon for a project. he tries to cut each piece to be 12 inches long, but sometimes he cuts it too long or too short by as much as 0.25 inch.  

we can represent this information in an inequality as:

by the definition of absolute value function we will get,

upon combining our inequalities we will get,

therefore, the inequality   describes all the possible lengths (x), in inches, of the ribbons jaime cut.

step-by-step explanation:

the answer is a beach is the best place to be