determine if each language is regular, context-free or not-cf, and demonstrate (by construction of automata, grammar; or use of a pumping lemma) that your claim is true.
a. true b. false