Need answers to 1 and 3

ples.ion. lhen there exists some nondeterministic inite accepter that accepts L (r). Consequently, L (r) is a regular language. Proof: We begin with automata that accept the languages for the simple regular expressions , , and a E . These are shown in Figure 3.1 (a), (b), and (c), respectively. Assume now that we have automata M (ri) and M (r2) that acept languages denoted by regular expressions ri and T2, respectively. We need not explicitly construct these automata, but may represent them schematically, as in Figure 3.2. In this scheme, the grapa fo 71 91 FIGURE 3.1 (a) nfa accepts , (b) nfa accepts {). (c) nfa accepts {a}. Mr) Schematic representation of an nfa accepting L (r)