3. Consider the finite automaton M, and answer the related questions. (a) For each of the following strings specify whether or not it is accepted/recognized by Ms. i. 0100 ii. 1001 iii. 0101 iv. 1 v. 11111 vi. 0101011 (b) Describe in English the language that Ms accepts/recognizes @) Specify the language of My formally (e., using set notation). (a) For each of the following strings specify whether or not it is accepted/recognized by Mz. i. 0100 ii. 1001 iii. 0101 iv. 1 v. 11111 vi. 0101011 (b) Describe in English the language that My accepts/recognizes. (c) Specify the language of M, formally (i.e., using set notation), (d) Is Ma a DFA or an NFA? Explain your