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) Make sure you answer all three partsas Chegg allows you to answer up to 4 parts of aquestions.
1. For each part below, draw the state machine of an ordinary Turing machine (deterministic, and not any of the variants
OR
OR