Propositional Equivalences

$6$a Use a truth table to show if $pq$ logically equivalent to $qvvq.($To create your table, in the toclbar, Insert $>$ Table$)$

Hint $(pq)harr(pvvvvq)$

$($Create the table herel$)$

$6$b$.$ Evaluate the truth tablie you created above $-$ is it a tautology, contingency or contradiction.

$7.$ Identify the equivalence law.

$p^{{?}^{?}}$not$-=-q^{{?}^{?}}p$

$8$ Apply the DeMorgan's Law and doutile negation to find a compound proposition that is

Bit Strings and Bitwise Operations

$9.$ Aoply the given bitwise operators to the follawing bitstrings:

$11000011$ AND $10101010=$

$11000011$ OR $10101010=$

$11000011$ XOR $10101010=$