1. (10 points) Consider the FA Mgiven below: a. Consider strings 10, 010, 1000, E. Which ones are accepted by Mz? Show the configuration traces of the above strings that are in L(M2). (Remember to use proper notation to showcase the trace of each string) b. Formally define the language recognized by M . (Aim for a description that clearly outlines the constraints of the language, e.g., L(Ms) = {x is a string over {alphabet} x fulfills constraint A and constraint B and...})