(1 point) Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzl. Consider the LFSR represented by the polynomial x4+x2+x+1 What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent p5=0,p4=1,p3=0,p2=1,p1=0,p0=1)