Consider the $($binary$)$ language L $=\{$w $|010$ or $101$ is a substring of w$\}.$

a$)$ Draw a DFA that recognizes exactly the regular language L$.$

b$)$ Prove by mathematical induction that the DFA you provided in a$)$ recognizes exactly the language L$.$