(6 pts.) Let T be a TM accepting language L. Show that if there is an integer n so that no matter what the input string is, T never moves its tape head to the right of the nth tape square, then L is regular (6 pts.) Let T be a TM accepting language L. Show that if there is an integer n so that no matter what the input string is, T never moves its tape head to the right of the nth tape square, then L is regular