please show work

3. Given the following language: Show that the language L is decidable by constructing a Turing Machine to decide if any string is in L or not. Do this in three steps: (a) Provide a high-level description of your algorithm. (b) Provide an implementation description to describe the Turing machine. Answer: Answer: c) Provide a formal description of the Turing machine (giving the full state diagram). Answer See the attached TM image. 3. Given the following language: Show that the language L is decidable by constructing a Turing Machine to decide if any string is in L or not. Do this in three steps: (a) Provide a high-level description of your algorithm. (b) Provide an implementation description to describe the Turing machine. Answer: Answer: c) Provide a formal description of the Turing machine (giving the full state diagram). Answer See the attached TM image