Please help explain well. Found an answer on other sources but it wasn't clear.

3. Let T be the Turing Machine whose quintuples are: (0, 0: 0, R, 0) (2, 0: 0, R, 4) (4, 0: 1, R, 3) (0, 1: 0, R, 1) (2, 1: 1, R, 0) (4, 1: 1, R, 4) (1, 0: 0, R, 2) (3, 0: 1, R, 1) (1, 1: 0, R, 3) (3, 1: 1, R, 2) (a) Walk through the operation of machine T applied to the following input tapes. Assume the R WH starts in state s = 0 reading the leftmost nonblank character. (i) ...000110011000... (ii) ...000111110000... (iii) . ..00 10010100DO... (iv) ...0000011001000... (b) What function does this machine evaluate? That is, if the input tape contains the binary representation of the integer n, what is left on the tape when T halts? // Hint: look at the input and output strings in decimal. (c) The final state is 0, 1 etc. Interpret this value as a function of the input integer n