Answer Happy

Build a Turing Machine for the language B. Show both qaccept and qreject. Assume there is a leading blank. Let 2 = {a, b}. {w | w has three a's for every b in the string}