2. Design a standard Turing machine (one tape, deterministic) with input alphabet fa.bl solves the following decision problem: Input: String over alphabet fa,b Output: Yes: if each occurrence of the letter b in the input string is either preceded or followed by an a No: otherwise Examples: abba abab, babbabba, aaaa are accepted. bbaa, babbbaaa are not accepted. a) In one or two sentences, describe the strategy of your machine. b) Give the state diagram for your machine. Show
OR
OR