(1 point) Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzi. 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 01100001 = xox1x2x3X4X5X6X7 when encrypted by the LFSR produced the ciphertext 10000110 = yoYi 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)