Provides a grammar that generates the language:

L $=\{$a$^$i cb$^$k $|$ i$,$ k $>=1$ and i $<=$ k$\}$

$-$Gives a description of the strings belonging to the language through informal analysis.

$-$What type of grammar does the language belong to$?$

$-$Converts the grammar into an automaton that accepts the same language and displays a configuration that accepts the string w $=$ acbb.