$(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

$01011110=x_0{x}_1{x}_2{x}_3{x}_4{x}_5{x}_6{x}_7$

when encrypted by the LFSR produced the ciphertext

$11000101=y_0{y}_1{y}_2{y}_3{y}_3{y}_5{y}_6{y}_7$

What are the tap bits of the LFSR$?$ Please enter your answer as unspaced binary digits $($e$.$g$.0101$ to represent

$p_3=0,p_2=1,p_1=0,p_0=1$