Using the method described in Section 9.1 and in class convert the following regular expression into a state diagram:

(01 + 10) 1

Note that the closure operation has highest precedence (see page 164 in the text). Thus the expression 01 denotes exactly one 0 followed by any number of 1s. Your answer should indicate how you arrived at the result: As intermediate steps write down the state diagrams that you construct for subexpressions of the given regular expression, and for each intermediate step clearly indicate which subexpression it corresponds to. Please do not simplify/modify the state diagrams. Simplifications/modifications of the state diagrams are considered as errors when marking (independently of whether or not the state diagram remains equivalent).