Question 2: Consider an LFSR using the recurrence Xn-5 = xin + 2n+2 + Xn+3 (mod 2). (a) Suppose we use the initial values (X1, X2, X3, X4, X5) = (0, 0, 1, 0, 0). Compute the first 15 bits of the sequence generated by the LFSR on these initial values (including the first five bits 00100). What is the period of this sequence -- that is, the length of the shortest repeating substring? First 15 bits (as O's and 1's without commas or spaces separating them, e.g., "000111"): Period of the sequence: (b) Suppose we use the initial values (X1, X2, X3, X4, X5) = (0, 0, 1, 1, 0). Compute the first 15 bits of the sequence generated by the LFSR on these initial values (including the first five bits 00110). What is the period of this sequence? First 15 bits: Period of the sequence