Complete the following truth table. Treat each row of the inputs, ABCD as a $4-$bit unsigned

binary value. The output should be $1$ on a row if the number is a prime number. If the number is

a perfect square, the output should be a don't care.

$($For example, input $1010=10,$ this is not a prime number or a perfect square so the output on

this row should be a $0.)$

Write an expression for $F$ using the sum of minterms form. Ex$.F(x,y,z)={\displaystyle \underset{?}{\overset{?}{}}}m(1,2,3)+{\displaystyle \underset{?}{\overset{?}{}}}d(4,5)$

You don't need to write the minterms themselves. $($Ex$.x^{\text{'}}y{z}^{\text{'}}+xy{z}^{\text{'}}$ etc. is NOT needed.$)$

$F(A,B,C,D)=$