PLEASE READ CAREFULLY BEFORE ANSWERING FOR A GOOD RATING

Really wish I knew how you no one can read this handwriting.....

Let B be a turing machine that accpets language L. Show that ifthere is an integer k so that no matter the input string, B nevermoves its tape head to the right of the k^th tape square,then L is regular.

Split L insto subsets based on weather the string is less than,equal to, or greater than k.

Let B be a turing machine that accepts language I. Show if there is an integer K so that no matter the input string, B never moves it's tape head to the right of the kth tape square then I is regular. Split Linto subsets based on whether String is less than equal to, or greater than k