Question 2 In the following Deterministic Finite Automaton (DFA): 1 0 Si S2 0 What statement(s) ectly describe(s) the state machine? Mark all correct answers. All accepted strings must end with 1. Accepted string will never have three consecutive O's in it. The length of accepted string is at least 2. Number of 1's in the accepted string must be an odd number. All accepted strings must start with 1. Number of O's in the accepted string must be an even number