1. Draw the state-transition diagram for a nondeterministic FSM that recognizes the strings A((ABC) I(ACB))*A.
2. Describe (in English) a general procedure for deriving an NFSM recognizer from a regular expression. Your procedure description will doubtless be recursive and should be based on the regular-expression syntax given in section 6.5,