Please solve 22 and 23 using the figure given below

2. Let L be the language accepted by the automaton in Figure 2.2. Find a dfa that accepts L3. 23. Let L be the language accepted by the automaton in Figure 2.2. Find a dfa for the language L2L. Consider the dfa in Figure 2.2. In drawing Figure 2.2 we allowed the use of two labels on a single edge. Such multiply labeled edges are shorthand for two or more distinct transitions: The transition is taken whenever the input symbol matches any of the edge labels. The automaton in Figure 2.2 remains in its initial state q0 until the first b is encountered. If this is also the last symbol of the input, then the string is accepted. If not, the dfa goes into state q2, from which it can never escape. The state q2 is a trap state. We see clearly from the graph that the automaton accepts all strings consisting of an arbitrary number of a 's, followed by a single b. All other input strings are rejected. In set notation, the language accepted by the automaton is L={anb:n0}. FIGURE 2.2