Cryptoanalysis problem

Complete steps N = 4 through N = 15 of the Berlekamp-Massey Algorithm for the example in Table 3.2. Give the connection polynomial
and verify that your answer is correct by generating the first 16 fills of
the LFSR corresponding the your claimed connection polynomial, with
initial fill 10011. Hint: The linear complexity is L = 6.