Consider the following grammar. S →0A | B1 A → 08 B →1|ɛ Which of the following set is the FIRST(S)? Answer Choices: a. {0} b. {0, ε} c. {1, ε} d. {0, 1}

(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 11101101 = x0x1x2X3 X4 X5 X6 X 7 when encrypted by the LFSR produced the ciphertext 10000000 = YoY1Y2Y3Y3Y5Y6Y7. What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 0101 to represent P3 = 0, P2 = 1,p1 = 0, po = 1).