1) Determine the count sequence of an internal 4-bit LFSR built from a primitive polynomial. 2) Determine the count sequence of an external 4-bit LFSR built from a primitive polynomial. 3) Show a schematic of an external, 8-bit LFSR that is designed from a primitive polynomial (You do not have to determine the count sequence) Briefly explain why 100% fault coverage is not usually achievable. (Note: telling me that a stuck-at-0 fault on a hazard cover does not answer this question. I am not looking for examples.) A 5-bit internal LFSR is built from the generating polynomial 4) 5) Is this generating polynomial primitive? (Justify your answer) 1) Determine the count sequence of an internal 4-bit LFSR built from a primitive polynomial. 2) Determine the count sequence of an external 4-bit LFSR built from a primitive polynomial. 3) Show a schematic of an external, 8-bit LFSR that is designed from a primitive polynomial (You do not have to determine the count sequence) Briefly explain why 100% fault coverage is not usually achievable. (Note: telling me that a stuck-at-0 fault on a hazard cover does not answer this question. I am not looking for examples.) A 5-bit internal LFSR is built from the generating polynomial 4) 5) Is this generating polynomial primitive? (Justify your answer)