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

$110011011100=$s$0$s$1$s$2$s$3$s$4$s$5$s$6$s$7$s$8$s$9$s$10$s$11$

$.$

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 s$5=0,$s$4=1,$s$3=0,$s$2=1,$s$1=0,$s$0=1$

$).$

b$)$ 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$

$).$