(point) Note: The notation from this problem is from understanding Cryptography by Paar and Petzl. ALFSR with minternal state bits is said to be of maximal length if any seed state (except ) produces an output stream which is periodic with the maximal period 2-1 Recall that a primitive polynomial corresponds to a maximum length LFSR. Primitive polynomials are a special case of irreducible polynomials (roughly polynomials that do not factory in the context of LFSR, a polynomial is irreducible if every seed state (except zero) gives an LFSR with the same period (though the period length may not be maximal). We will call a polynomial with neither of these properties composite Classify the following polynomials as either primitive, irreducible, or composite by writing either Plor in the corresponding answer blank below a) z'++++ c) + x + 1 d) x ++