I need help with these questions 47 and 51.

47. Every compound statement is equivalent to a statement using only the connectives of conjunction and ne- gation. To see this, we need to find equivalent wffs for A B and for A B that use only and ,. These new statements can replace, respectively, any occurrences of A V B and A- B. (The connective +was defined in terms of other connectives, so we already know that it can be replaced by a statement using these other connectives.) a. Show that A V B is equivalent to (A"A B')' b. Show that A-> B is equivalent to (A B')' 48. Show that every compound wff is equivalent to a wff using only the connectives of V and ".(Hint: See 49. Show that every compound wff is equivalent to a wf using only the connectives of->and'.(Hint: See 50. Prove that there are compound statements that are not equivalent to any statement using only the 51. The binary connective | is called the Sheffer stroke, named for the American logic professor Henry Shef- Exercise 47.) Exercise 47.) connectives and V. fer, who proved in 1913 that this single connective is the only one needed. The truth table for l is given here. Sheffer also coined the term "Boolean algebra," the topic of Chapter 8, where we will see that this truth table represents the NAND gate