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)