PLEASE HELP ME WITH THIS PROBLEM AS QUICK AS YOU CAN. That would really help me out greatly. THANK YOU! 3. Indicate the output of M3 (accept or reject) for each of the following input strings: M30 a. 000 b. 111 90 C. 01010101 01011011 d. 4. Give five more examples of strings that are accepted and five strings that are rejected by M1 5. Give five more examples of strings that are accepted and five strings that are rejected by M2 6. Give five more examples of strings that are accepted and five strings that are rejected by M3 7. Describe the language of M1 (given in question 1) 8. Describe the language of M2 (given in question 2) 9. Describe the language of M3 (given in question 3) 10. Design a DFA to accept the language of strings over the alphabet {'o', 'p', 'q'} that end with 'p