Consider the language L = {w | w is in {a, b, c}* and w has an equal number of as, bs and cs}. So abbcac is in L. Give the full specifications (formal description) for a Turing machine that accepts L. Is L regular, context-free but not regular, or not even context-free? Is L decidable? Explain your answer.