Hello;

I am over my head in math. I have tried reading my text book to achieve a viable answer; however, I am incorrect in my answers.

1.) Construct a truth table for each of the following compound statements:

a.) (p∧q) ∨ ((¬p) → q)

b.) ¬ (p∧(q∨p)) ↔ p

2.) If p and q are statements, then the compound statement p⊻q (often called the exclusive or) is defined to be true if and only if exactly one of the p, q is true; that is, either p is true or q is true, but not both p and q are true. Construct a truth table for (p⊻((¬p)∧q))∨q.

Any assistance is greatly appreciated. As I have already stated; I am way over my head.