Chapter 2: Problem 7 Previous Problem Problem List Next Problem (1 point) Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzl. We conduct a known-plaintext attack against an LFSR. Through trial and error we have determined that the number of states is m = 4. The plaintext given by 10111001 = XoX1X2X3X4X5X6X7 when encrypted by the LFSR produced the ciphertext 01011010 = = Yo Yi Y2 Y3 Y3 Y5 Y6 Y7. What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 0101 to represent P3 = 0, P2 = 1, P1 = 0, po = 1)