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 show that for 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. (Hint: To get started think about how many steps the TM can make while staying on the same tape square without repeating the same configuration (and hence being in a loop)).