[5 points] The language accepted by the automaton is, L={0m1n,n>1 and m>0} a. Give the five tuples for the definition of DFA. b. Give the state transition table. c. Draw the state diagram recognizing above language. d. Give the string acceptable by the above language and its sequence states