(1 point) Note: The notation from this problem is from understanding Cryptography by Paar and Polzi. 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 01111101 = 19314151627 when encrypted by the LFSR produced the ciphertext 01010101 - 09/19/21/395097 What are the tap bits of the LESR? Please enter your answer as unspaced binary digits (0.9. 0101 to represent ps = 0,72 = 1.P1 = 0,pe - 1)