Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzl.

Consider the LFSR represented by the polynomial x$4+$x$2+$x$+1$x$4+$x$2+$x$+1.$

What are the tap bits of the LFSR$?$ Please enter your answer as unspaced binary digits $($e$.$g$.010101$ to represent p$5=0,$p$4=1,$p$3=0,$p$2=1,$p$1=0,$p$0=1$p$5=0,$p$4=1,$p$3=0,$p$2=1,$p$1=0,$p$0=1).$