ANSWER B, Thank you

6 Design a Turing machine by providing the algorithm and transition diagram for the following problem specification. Input : n 1's, O, m 1's, O, more than n*m b's Output : replace n*m b's with 1's (It does not matter what happens to other 1's) : 1101110bbbbbbb (2x3=6) Example Input Output : ?????0111111b Example Input_: 110110bbbbb Output: ??0??01111b (2x2=4) b) Show the ID for input 1101110