How to solve

$(25$ points$)$ Examine each CFG below and, by generating strings using the grammar, determine what language each grammar generates. You do not have to show your sample strings. Use set notation for your answer.

a$.A1A|lon||$

b$.B0B|1A||$ where $A$ is as above

c$.C1D|1||$ where $D1C$

d$.$ Where in the Chomsky Hierarchy would we find $($together$)$ all of the languages from parts $($a$),($b$),$ and $($c$)$ above?

e$.$ Look up regular grammars on Wikipedia. In each of the sections Strictly regular grammars and Extended regular grammars there are defined two kinds of grammars. Which characterizes all of the grammars in parts $($a$),($b$),$ and $($c$)?$