(Solved): 1) Complete the following truth table. Treat each row of the inputs, ABCD as a 4-bit signed binary ...

1) Complete the following truth table. Treat each row of the inputs, $ABCD$ as a 4-bit signed binary value. The output should be 1 on a row in two cases: first, if the number is divisible by $3,OR$ second, if the number is both negative AND divisible by 4 . Any numbers divisible by 5 are don't cares. All other rows should have an output of 0 . (For example, input $1010=?6$, this IS divisible by 3 , so the output on row 1010 should be 1 .) Write an expression for $F$ using the sum of minterms form. Ex. $F(x,y,z)=?m(1,2,3)+?d(4,5)$ You don't need to write the minterms themselves. (Ex. $x^{?}y{z}^{?}+xy{z}^{?}$ etc. is NOT needed.) $F(A,B,C,D)=$