1. 3.52 Write a proposition logically equivalent to p ⊕ q using only the logical connectives ⇒, ¬, and ∨. 2. The following code uses nested conditionals, or compound propositions as conditions....

1. 3.52 Write a proposition logically equivalent to p ⊕ q using only the logical connectives ⇒, ¬, and ∨.

2. The following code uses nested conditionals, or compound propositions as conditions. Simplify each as much as possible. (For example, if p ⇒ q, it’s a waste of time to test whether q holds in a block where p is known to be true.)