Consider the following FSA over the alphabet (a,b with starting state s0. The accept states are marked with double circles. 1. Describe the language recognized by this FSA? 2. Show the transition table for this FSA 3. Build an equivalent FSA with reduced states 4. What language is recognized by the complement of the reduced FSA