For each question give two rules of a $\backslash$Sigma rewriting system $($for the $\backslash$Sigma given$)$

that generate the language shown from the initial word given. Where there

multiple possible sets of rules for a question, give the rules that contain the

fewest symbols.

$1.$ I $=$ a; L $=\{$b$,$ c$\}$; $\backslash$Sigma $=\{$a$,$ b$,$ c$\}$

$2.$ I $=$ a; L $=\{$b$,$ bb$,$ bbb$,$ bbbb$,...\}$; $\backslash$Sigma $=\{$a$,$ b$\}$

$3.$ I $=$ a; L $=\{$c$,$ cb$,$ cbb$,$ cbbb$,...\}$; $\backslash$Sigma $=\{$a$,$ b$,$ c$\}$