Please draw the NFA and DFAs!!

2. Nondeterminism Consider the following language: L2={uvu,v{a,b},u contains an even number of a's, and v contains an even number of b's } Note that as long as there is some way of cutting a string into u and v so as to satisfy the constraints, it's in L2. So ba L2, because u= b has an even number (0) of a's and v=a has an even number (0) of b's. But ab /L2, because every way of cutting it violates a constraint: u=v=abvhasoddnumberofbsu=abv=uhasoddnumberofasu=av=bbothuandvviolateaconstraint (a) Write an NFA N2 that recognizes L2. (b) For n=1,,4, show the accepting path (as a sequence of states) for babn through N2, and show where the boundary between u and v occurs. (c) Convert N2 to a DFA M2 using the subset construction (Theorem 1.39). (d) For n=1,,4 show the accepting path for bab n through M2. Does M2 "know" where the boundary between u and v is