the previous question is:

Problem 3 (10 points). Let A be the DFA you defined in the previous problems, and consider the string w = 001011. Confirm that w e L(A), by showing that s* (qo, w) e F where qo is the start state of A and F is its finish states. You have to show this formally using the inductive definition of * provided in Slide 5 of Lecture 6. (Start with S* (20,0) and then f* (q0,00) and then 8* (90,001) and so on...) 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)