3. (20 points) Consider the finite automata in Figure 1. Provide a formal definition for C (as covered in dless, including states, alphabet, etc.) b. Which of the following strings does accept? L 1 IL 0010 III. 000 Iv. 11011 V. 5 c. Describe informally (In your own words, the language of le, what is the common pattern among the accepted strings? LO Figure 1. Finite automate Cin Problem 3