Suppose that we are trying to prove that "p and (q or r)" implies "p xor (not q and not r)". Is the following a valid strategy? Assume "p and (q or r)", derive "(p and q) or (p and r)", then assume "(p and q) or (p and r), and derive "p xor (not q and not r)" Select one: O True False