Explain briefly about the equivalence between regular languages and right linear grammars. Explain what it means by "the set of regular languages is closed under the operation reverse" (Do not prove the statement. An explanation is sufficient. Prove that every left linear grammar G has an equivalent right grammar. Let G be the reverse grammar of G. (You can assume LR(G)-L(G) and the above two facts. All you need to do is to connect the logical steps.)