Design a Deterministic Finite Automata that accepts any string of any length over the alphabet $(0,1)$ which contains $101$ as a substring, then convert it to a Turing Machine, and make sure to include the accept and reject states.prvide the state diagrams of the designed machines