Question2 in the photo. Please help. Thanks

1. Construct an NFA that accepts the language La = {zaaabyaaabzla, y, z E {a, b)' } 2. Eliminate the e-transitions (denoted as E's below) from the following NFA s.t. the resulting machine accepts the same language with the same mumber of states. ql a,b go q3 2 3. Text problem: page 62, number 3. Finish by reducing the DFA. Note that you may want to do this in stages, first eliminating the e-transition ( in text), then converting to a DFA 4. Text problem: page 68, number 1. Begin by relabeling the initial states to qo, gi, etc. 5. Text problem: page 68, number 2 b. Proving that a DEA is minimal means that all sta sure to show the partitioning steps you used to find the solution. distinguishable, which is true if you follow the minimization algorithm shown in class l ihlactates (those that are not reacha