I need to check my work

SHOW ALL THE STEPS TO RECEIVE FULL CREDIT FOR EACH OF THE FOLLOWING: 1. (5 points) Give two strings of different lengths that are accepted by the above NFA. 2. (5 points) Describe the extended transition function on the above two strings using transitions one symbol at a time. 3. (30 points) Convert the NFA to an equivalent DFA (Don't need to include a trap/dea state) Describe the state diagram and label the new states using new labels A,B,C,D,E, (as needed) 4. (20 points) From above DFA, write an equivalent regular grammar as (V,T,P,S) 5. (20 points) Convert the above to an equivalent minimal DFA. Show the partitioning steps. Give the state diagram of the minimal DFA. 6. (20 points) From above minimal DFA, describe an equivalent regular expression. Create a new start state (s) and a new final state (f). Show step by step eliminating one state at a time in deriving the regular expression