Using the example Turing machine of the figure 10.4 is a model create a set of instructions so that the processor rides a Y in the empty cell if there is at least one B anywhere in the sentence otherwise right an N Hint The processor only needs two states only one state representing the no B Has been seen and one state representing the at least one B hasn’t been seen

To test your work make sure that your turning machine works for these examples in the examples “___” represents the empty cell