(E = epsilon) Basic results from automata theory tell us that the language L = an ban can = E, abc, aabbcc, aaabbbccc,... is not context free. It can be captured, however, using an attribute grammar. Give an underlying CFG and a set of attribute rules that associates a Boolean attribute ok with the root of each parse tree, such that Rook = true if and only if the string corresponding to the fringe of the tree is in L. hint: the attribute on the rule for the root node should be something like "S.ok = [some boolean check function)". That is, S.ok evaluates to true if the conditions of the language are met. The conditions of the language are, simply, that there are an equal number of a, b, and c characters. You'll first need to write a CFG that can accept such a language and then add in the attributes to each rule)