a$)$ For a given set of alphabets $\backslash$Sigma $=\{$a$,$ b$,$ c$\},$ describe $($in English text$)$ the languages generated by grammar below:

S $->$ AB

A $->$ aAb $|\backslash$epsi

B $->$ bBc $|\backslash$epsi

Your answer should be generic$$ that is$,$ it should be true for all possible strings within the given language.

$($b$)$ Consider the below grammar for the alphabets $\backslash$Sigma $=\{$a$,$ b$\}.$ Identify if there$$s any redundant rule included. If so$,$ identify the redundant rule with proper justification. X $->$ bXa $|$bM

M $->$ bM $|$ aM $|\backslash$epsi