3.52 Write a proposition logically equivalent to p@q using only the logical connectivesand V The folowing code uses nested conditionals, or compound propositions as conditions. Simplify each as much as possi- ble. (For example,ifpg, it's a aaste of time to test whether q holds in a block where p is known to be true.) 3.53 3.55 if(x>20 or (x20 and y 0)) then if not (x % 4-0): then foo(x,y) else bar(x,y) then foo(x) else bar(x) 3.54 else if (x17): then baz(x) else quz(x) if (y 0 or y X or (x y) y0) then foo(x,y) else bar(x,y) (Note that x % k- is true when mod k-0, also known as when k | x.)