Turing Machine closed

Question

Design a TM that accepts strings over the alphabet{a,b}

i)Of even length

ii)containing the substring "abababa"

iii)not containing two consecutive zeros

Comments

Please provide state transition diagram for all the above machines

---

all 3 are regular languages, what exactly is the issue you are facing while drawing TM?

and please correct 3rd option