Assume m is a tm whose program only allows the tape head to move right or stay stationery, but that it never moves left. prove that the language of m is decidable. in particular, give an algorithm which shows thatfor any input w to m we can decide if m(w) loop or halts. from this conclude we can decide l(m)= the set of strings w that m accepts.