"(1) Assume A is a wff(well formed forumla). Give a proof by induction that in order to assign a truth value to A it suffices to assign truth values...

"(1) Assume A is a wff(well formed forumla). Give a proof by induction that in order to assign a truth value toA it suffices to assign truth values to variables occurring in A.(2) Provide a defnition by recursion of a function F such that for every wff A, F(A) is awff obtained from A by replacing all occurrences of p with q and all occurrences of q with psimultaneously. (For example, F((p ! q)) = (q ! p).)"