I need assistance with Linear Feedback Shift Registry (LFSR), trying to compute the correct matrices to find c₀, c_1. Please provide a step by step guide on how to compute the two questions below

(6) This question explores lfsr sequences. (a) Consider the sequence starting :51 = 1, x2 = 0, 333 = 1 and dened by the length 3 recurrence 93n+3 E can + 33n+1 + $n+2 (mod 2). This sequence can also be given by a length 2 recurrence. Determine this length 2 recurrence by setting up and solving the appropriate matrix equa tions. (b) Suppose we build an LFSRtype machine that works mod 2. It uses a recur rence of length 2 of the form 55714.2 E C033", 'l' C133n+1 'l' 1 (mod 2). to generate the sequence 1,1,0,0,1,1,0,0. Find c0 and c1. 6+6=12 marks