Consider a function f with 4 bits of input a3a2a1a0 such

Question

Consider a function F with 4 bits of input A3,A2,A1,A0 such that the output of F is

1 if the unsigned binary number represented by A3A2A1A0 is a prime (i.e., 2, 3, 5, 7, 11 or 13).

Otherwise, the output of F is 0.

(a) Write the truth table for F.

(b) Implement F using a 16x1 MUX and nothing else.

(c) Implement F using a 8x1 MUX, some AND gates, some OR gates, and some NOT gates.