1.(20pts) For each of the generators below, indicate what language class they generate or accept. (a) for regular languages RL, (b) for context-free languages CFL, c) for recursively enumerable languages RE, and (d) for other. 9 PDA: NFA .Multi-tape TM: Non-deterministic TM DFA: Regular Expression.- 2. Give an example of a regular language that is not context-free, or prove that one does not exist. 3. Give an example of a context-free language that is not regular, or prove that one does not exist. 4. Give an example of a context-free language that is not recursive, or prove that one does not exist. 5 Using the theorem that given an undirected graph whether there exists a Hamilton circle that visits each node exactly once and returns to the starting node is an NP complete problem, prove that Traveling Sales Person problem, where given an undirected graph, we ask whether there exists a route of length k or less that visits each node once and returns to the starting node is NP-complete