Let L be the language of all strings α ∈ {a,b, c} ∗ such that |α|a −|α|b = 2, i.e., the number b's in α minus the number

[answerhappygod]

Let L be the language of all strings α ∈ {a,b, c} ∗ such that
|α|a −|α|b = 2, i.e., the number b's in α minus the number of a's
must be equal to 2. (Hence, for all strings α in L the number of
b's, must be larger than the number of a's.)
(a) Design a deterministic Turing machine that accepts L.