Give an example of a recursive definition for set F of Boolean expressions on variables in set A = a1, ..., an involving only operations ∧ and ∨. What would be the base case
