Consider the following Turing Machine and the string $10110111101101$

Nark all correct answers

a$.$ The purpose of q$9$ transitions is to rewind the tape and stops at the the most right character of the string

b$.$ the automat stops at Q$8$

c$.$ the automat stops at Q$7$

d$.$ When the automata halts $($stops$)$ the right most character is $x$

e$.$ the automat stops at Q$10$

f$.$ The Turing machine accepts the string and its reverse

g$.$ the automat stops at Q$9$