a.

Produce a truth table for a prime number checker. The number to check is a 4 bit integer. The output f is 1 if the number is prime and is 0 if the number is composite.

b.

Produce an algebraic form for the output bit f.

c.

Simplify the algebraic form for f as much as possible.