Problem 1. Give an implementation-level description of a Turing machine M that decides the language B 012 n 2 0, i.e., M accepts if input string is in B and rejects otherwise