Stuck on this one. Ignore the scribblings

2. The IF connective is a binary connective defined as IF A,B) (NOTA)ORB. It is often bet written A B. (a) Write a truth table for the IF connective. It will have 4 rows. (b) Show that {IF, NOT] is a complete set of connectives. To do this, you need to show that w to :/./ either AND or OR can be expressed in terms of IF and NOT. 0-2. (c) Letbe a connective that always returns False. Show that {IF is a complete set of Again, you need to show that some other complete set of connectives can connectives. be expressed in terms of IF and