PLEASE IF YOU SOLVE ANY EXERCISE MAKE SURE YOU CORRECTLY FINISH IT ALL OR LEAVE IT TO SOMEONE ELSE.

Please I want a detailed complete answers for each part. Then make sure you provide clear picture(s) of soultions that I can read. Try making all numbers and letters clrearly readable easy to recognize. You also can type it which I prefer so I can copy all later, paste them in Microsoft Word to enlarge & edit if needed. Thanks for all :)

The transition graph below describes a non -deterministic automaton. q2 q0 4 Write the formal definition of the automaton. Find 3 strings accepted by this automaton and 3 strings rejected by it -Write a definition of the language accepted by the automaton Exercise 2: Design an NFA that accepts the following language a) L= {w | w contains an even number of 0s or contains exactly two 1's)(no more than 6 states) b) L-(a",n2 lu {b"a* m 2 0, k 20 (no more than 3 states) c) (ab, abc)* Exercise3: Find the DFA that is equivalent to the NFA in exercise 1), 2-b)