Show that the following languages are either regular, context free or context sensitive. Remember if a language is regular, it is also context free and context sensitive. Unless otherwise stated or implied, – fa,b). For each of the languages, you should write the formal definition in the appropriate form and give the appropriate structure to show acceptance of strings of the language. If a language
OR
OR