1. Let S = {0,1}. Give an FA (finite automaton) that accepts the language consisting of the set of all strings over that contain at least two O's and have last character a 1. (Note that 00 and 1 are two examples of strings that are not in L, but 0101 is an example of a string that is in L.) Also, what is 8* (90, 0101) for your FA (where do is your initial state and S is the transition function for your FA)