Write the Grafstate code for a Turing machine that enumerates the language described by the regular expression $($ab$)*.$ use the following grafstate code as an example for formating:$+$ tm $($ab$)*$

Q$=\{$q$1,$q$2,$q$3,$q$4,$q$5,$q$6\}$

S$=\{$a$,$b$\}$

T$=\{$a$,$b$,$A$,$B$,$L$,$R$,$S$,\backslash \_,$#$\}$

tapes$=2$

q$0=$q$1$

q$1->$q$2$:$\backslash \_->\backslash \_,$S;$\backslash \_->$a$,$S

q$2->$q$3$:$\backslash \_->$a$,$R;a$->$a$,$R

q$3->$q$4$:$\backslash \_->$b$,$R;$\backslash \_->$a$,$S

q$4->$q$5$:$\backslash \_->$b$,$R;$\backslash \_->$b$,$R

q$5->$q$6$:$\backslash \_->$#$,$R;$\backslash \_->$b$,$S

q$6->$q$4$:$\backslash \_->\backslash \_,$S;$\backslash \_->$a$,$R

q$4->$q$4$:$\backslash \_->\backslash \_,$S;$\backslash \_->$b$,$R

q$4->$q$4$:$\backslash \_->\backslash \_,$S;$\backslash \_->\backslash \_,$S

done.