PLEASE HELP ME WITH THIS PROBLEM AS QUICK AS YOU CAN. That would really help me out greatly. THANK YOU! What is the language of each of the following automata (M1, M2, M3, M4)? 0,1 M1 0 1 1 2 90 91 0 M2 a,b M4 a,b.c 91 d d a,b,c 2 92 u 93 d u 94 95 u Add the transitions to the automaton below The language of all strings that contain the string 001 as a substring Things to remember 1. haven't just seen any symbols of the pattern 2. have just seen a 0 3. have just seen 00 4. have seen the entire pattern 001 . Assign a state to each possibility & set the start state and end state(s) 98 qo 900 4001 Assign the transitions by seeing how to go from one possibility to another upon reading a symbol