this one problem separatet into two section

(1 point) Suppose you have an LFSR with state bits (also known as the seed) (S5, S4, S3, S2, S1, So) = (0,0,1,0,1,0) and tap bits (also known as feedback coefficients) (P5, P4, P3, P2, P1, po) = (0,1,1,1,0,1). What are the first 12 bits output by this LFSR? Please enter your answer in the form of unspaced binary digits (e.g. 010101010101). These come in order So S1 S2 ... $11. (1 point) Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzl. Suppose you have an LFSR with 6 state bits. The first 12 bits of output produced by this LFSR are 111100011111 = so S1 S2 S3 S4 S5 S6 S7 S8 S9S10 S11 The first bit produced is the leftmost bit and the bit most recently produced is the rightmost bit. a) What is the initial state of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent S5 = 0, $4 = 1, S3 = 0, $2 = 1, s = 0, so = 1). b) 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, po = 1)