3. (5 points) Answer True or False. Justifications aren't required for credit for this question, but it's good practice to think about how you would explain why your answer is true. Fix an arbitrary (but unknown) alphabet (a) A non-context-free language must be uncountably infinite. (b) The set . is an example of a regular set that is a superset of all non-context-free languages over . c) The union of a finite set with a context-free set is context-free. (d) The complement of each context-free language is non-context-free (e) If a CFG is ambiguous then the language that it generates is non-context-free