Draw a transition diagram for a Turing Machine that accepts the language using the following approach...

For each part below, draw a transition diagram for a TM that accepts AEqB-ve {a, b)" I na(x) = nbx)y by using the approach that is described a. Search the string left-to-right for an a, as soon as one is found, replace it by X, return to the left end, and search for b; replace it by X, return to the left end and repeat these steps until one of the two searches is unsuccessful. b. Begin at the left and search for either an a or a b, when one is found, replace it by X and continue to the right searching for the opposite symbol; when it is found, replace it by X and move back to the left end, repeat these steps until one of the two searches is unsuccessful