1. Write out truth tables for each compound proposition: (you may clearly handwrite your truth tables.) (a) p(qr) (b) (qp)(rp) (c) (q(rp)) 2. Draw a combinatorial circuit with three binary inputs x0,x1,x2 and four binary outputs z0,z1,z2,z3 such that 2(x2x1x0)s,3=(z3z2z1z0)2c,4 (Note that (x2x1x0)s,3 is an integer represented by the sign-magnitude representation and the output (z3z2z1z0)2c,3 is an integer represented by 2's complement.) (Hint to get started: create a "truth table" with 0's and 1's and make a separate circuit for each of the output bits z3,z2,z1,z0.)