Discrete Math

Consider the Turing machine T defined by the following five-tuples describing a transition function (s_0, 0, s_0, 1, R), (s_0, 1, s_0, 0, R), (s_0, B, s_1, B, L) (s_1, 0, s_2, 1, L), (s_1, 1, s_1, 0, L) Describe the set of states and the alphabet for T. In what situations does T terminate? Showing each step of the machine find what happens with input 110010