4. Suppose x is a real number. Negate the statement 3 ≤?< 4 and simplify. Show and explain all work in full sentences and name the logical equivalences you use. Your final answer cannot contain any negation symbols.
5. Demonstrate that (?→ ?) ∧(?→ ¬?) is not a contradiction a. By identifying a choice of truth values for p and q that makes the statement true (explain your answer). Do not write a complete truth table. b. Through simplification using logical equivalences. Name each rule. You must simplify until only one letter (p or q, not both) and one negation symbol remains.