true/false please answer last 3 questions

21 Uncountable infinity (for example, the cardinality of the real numbers). No Countable infinity (for example, the cardinality of the integers) All strings over the alphabet ?. ?? ??? CFG Context-free Grammar CFL Context-free Language L(G) The language generated by a CFG G L(M) The language accepted by the automaton M. PDA Pushdown Automaton/Automata ISI The cardinality of set S. For example, ll 0, and if S is an infinite set, ISI could be Ko oral. wourd be ciosedo under F 33. A universal TM can simulate any other TM. F 34. If M is a TM with input alphabet ? and tape alphabet then ? c r. (That is, ? is always a proper subset of ?). 5. To prove that L LeD F 3 D by a reduction from H, you need to show that if H e D then