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 Tip: Split L into subsets based on whether the length of the string is less than, equal to, or larger than n. Why will the first two subsets be regular? Can you express the third in terms of the first two? Why will it be 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 Tip: Split L into subsets based on whether the length of the string is less than, equal to, or larger than n. Why will the first two subsets be regular? Can you express the third in terms of the first two? Why will it be regular