1. Let = {0, 1} and consider the following state-transition diagram: 0 0 0 (a) Give three examples of strings that are accepted by the transition diagram and three examples of strings that are not accepted by the transition diagram. (b) Write explicitly the transition function that defines the transitions of the diagram. (c) Is the transition diagram deterministic or nondeterministic? Explain briefly. (d) What is the language recognized by the state transition diagram? Describe (in English) conditions that characterize exactly all the strings in the language