For the following statement: a) rewrite it formally; then write the b) negation, the c) converse, d) inverse, and the e) contrapositive 1. This loop will repeat exactly N times if it does not contain a "stop" or goto". For the following statement: write the a) negation, b) converse, c) inverse, d) contrapositive; and for each of those write it informally, and tell the truth value. 2. xR,yRxy=1 Write the truth table: 3. p(qp) Use a truth table to determine equivalence: 4. p(qp)=?pq Write the a) Input/Output Table, and b) Boolean Expression for the following circuit: Use Input/Output tables ta determine equivalence: 6