the previous question is:

Problem 2 (10 points). Translate the graphical representation of a DFA in your previous problem to the symbolic syntax defined in 1.5 (5-tuple discussed in class). Use a transition table to define the transition function. Problem 1 (10 points). Using graphical notation, define a DFA that accepts all strings over the alphabet {0, 1} that contain either the substring 10 or 01 (non-exclusive, i.e. both can be contained as substrings)