I would like to create a game using python code. Part of this game involves determining, and creating something called "WFF's" or "well-formed formulas." These are very similar to the logician NAME_1 notation. For this game though, the specific rules will be, (a given expression is a WFF If and only if: 

1.	It is a ‘p’ , ‘q’, ‘r’, or ‘s’  
OR
2.	It is a two unit expression win which the first unit is an ‘N’ and the second unit is a WFF 
OR
3.	It is, a three-unit expression in which the first unit is a ‘C’, ‘A’, ‘K’, or ‘E’ and the second and third unit are WFFs. ) Before go further by generating some code, I would like to test your understanding. Which of the following are WFFs? 1. KNpNr 2.Api  3. NNNr 4. pq 5. p 6. o 7. sN 8. NCAKqprs 9. CNpApi 