Draw the state machine of an ordinary Turing machine(deterministic, and NOT any of the variants) that recognizes thegiven language (assume all missing transitions go to an implicitreject state; you do not have to draw these transitions, unlessspecified otherwise) Answer B and C.
1. For each part below, draw the state machine of an ordinary Turing machine (deterministic, and not any of the variants discussed in class) that recognizes the given language (assume all missing transitions go to
OR
OR