S -> aSb | bSa

S -> aSa | bSb | ε

S -> aSa | bSb

S -> aSb | bSa | c

S -> aSb | bSa | ε

S -> aSa | bSb | c

None of the answer

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

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

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

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

non-terminal

Any arbitrary string

variable followed by a terminal

terminal

A → AC or A → a

{∈,a}

{a, ∈}

a*

{∈}

∅

Regular

Both Regular and Context Sensitive

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

Context free

Context Sensitive

Yes, it is regular

No, it is not regular

It is context-free but not regular

Cannot be determined