Give implementation-level descriptions of Turing machines that decide the following languages over the alphabet {0,1}.a. {w| w contains an equal number of 0s and 1s}."On input string w:1. Scan the tape and mark the first 0 which has not been marked. If no unmarked 0 is found, go to stage 4. Otherwise, movethe head back to the front of the tape.2. Scan the tape and mark the first 1 which has not been marked. If no unmarked 1 is found, reject. 3. Move the head back to the front of the tape and go to stage 1.4. Move the head back to the front of the tape. Scan the tape to see if any unmarked 1s remain. If none are found, accept; otherwise, reject."b. {w| w contains twice as many 0s as 1s}"On input string w:1. Scan the tape and mark the first two 0s which has not been marked. If no unmarked pair of 0s is found, go to stage 4. Otherwise, movethe head back to the front of the tape.2. Scan the tape and mark the first 1 which has not been marked. If no unmarked 1 is found, reject.3. Move the head back to the front of the tape and go to stage 1.4. Move the head back to the front of the tape. Scan the tape tosee if any unmarked 1s remain. If none are found, accept;otherwise, reject."c. {w| w does not contain twice as many 0s as 1s}."On input string w:1. Scan the tape and mark the first two 0s which has not been marked. If no unmarked pair of 0s is found, go to stage 4. Otherwise, movethe head back to the front of the tape.2. Scan the tape and mark the first 1 which has not been marked. If no unmarked 1 is found, reject.3. Move the head back to the front of the tape and go to stage 1.4. Move the head back to the front of the tape. Scan the tape tosee if any unmarked 1s remain. If none are found, reject;otherwise, accept."