6. In class, we only discussed error detection schemes; there are also error correction schemes that can not only detect that a bit flip has occurred, but can also identify which bit has flipped. One such scheme is the Hamming (7,4) code, which can send 4 data bits using 7 transmitted bits, and can detect and correct all 1-bit errors. In brief, you can imagine this scheme as transmitting bits b, by, b3, b4 using parity bits P1 P2 P3, where those parity bits are calculated as: P =parity(b1, b2b4) P2 = parity(b,b3, b4) P3 parity(b2.b3.b4) where the parity function returns the parity of the inputs (i.e., if the inputs have an odd number of 1s, it returns 1; otherwise it returns 0). 6a. Calculate the parity bits p,p2.p3 for the message b = 0, b = 1,b3 = 1, b = 1. (5 pts) 6b. Suppose that a receiver receives b = 0,b = 0, b3 = 1,b = 1,p = 1,p2 = 0,p3 = 1. How can the receive determine which bit has flipped? (5 pts) 6c. Suppose that a receiver receives b = 0, b = 1,b3 = 1,b = 1,p = 1,p2 = 1,p3 = 1. How can the receive determine which bit has flipped? (5 pts) 6d. What would happen at a receiver if two bits flipped? (5 pts)