b$)$ Finite$-$state automata recognizes languages including regular languages, context$-$free languages and context$-$sensitive languages. Determine the language that is recognized by the Deterministic Finite State Automata$/$machine below:

$5$

Masior Tupic

Finite Automata

alooms

Scare

Score

AN

c$)$ Context free grammars $($CFG$)$ and their associated languages utilize production rules. Given a grammar $G$ defined by the production rules

$S$aSa$|aBa|$

$BbB|b|$

Show that the language it recognizes is $L_G-\{a^4{b}^n{a}^2$:$n1\}$

$\backslash$table$[[$Mapor Taph,Howas,rove$],[$Context$-$Free Girammars,Ansmation,$]]$