S -> aSa | bSb | c

S -> aSb | bSa | ε

S -> aSb | bSa

S -> aSa | bSb | ε

S -> aSb | bSa | c

S -> aSa | bSb

{ bⁿ a^m | n ≥1, m ≥0} and its not regular language

{ (ab)^m | m ≥1} and its not regular language

{ bⁿ a^m | n ≥1, m ≥0} and its regular language

{ (ab)^m | m ≥1} and its regular language

None of the answer

terminal

variable followed by a terminal

non-terminal

A → AC or A → a

Any arbitrary string

{a, ∈}

∅

{∈}

a*

{∈,a}

Context free

All of mentioned (Regular, Context Free and Context Sensitive)

Both Regular and Context Sensitive

Regular

Context Sensitive

Cannot be determined

It is context-free but not regular

Yes, it is regular

No, it is not regular