[3 marks Consider the machine belovw The input alphabet is {0, 1,#5) and the tape alphabet is 1-{0, 1,#S, Assume that the tape of the machine initially contains a S on the leftmost square, followed by a non empty binary string s, followed by a # . The tape head is initially pointing to the $ Explain what is on the tape after the machine halts (stops running) 10. Accept 01, L 1--1,R 0--0, R 1, R 1+0, R 0-0, R 11,L 0 0L