please help

Let M be a Turing machine with the transition function (q,0)=(q,1,L)(q,1)=(r,0,L)(r,0)=(r,0,R)(r,1)=(r,0,L) Suppose M is in configuration (q,3,11000). Assume we index strings starting at 0 , so that x[0] is the leftmost symbol in x. What is the next configuration? (q,4,11000) (q,2,11010) (r,2,11000) (r,2,11010) (r,4,11010) (q,2,11000) (q,4,11010) (r,4,11000)