$(6)$ Design a DFA over $=\{a,b\}$ such that

every string acceptedmust start and ends cist

$\text{'}a\text{'}.$

$(7)$ Design a DFA over $=\{a,b\}$ such thot

overy string accepted must end wirn subrbing

bb

$(8)$ Design a NFA for question no$.(6)$

$(9)$ Design a NFA oves ${\displaystyle \underset{?}{\overset{?}{}}}=\{a,b\}$ such that it

accepts every string stanting and ending

with same symesd.

$(10)$ Design a DFA for queshoin no $(9).$

$(11)$ Design a DFA and NDFA that

accepts all string ver the alphabet

${\displaystyle \underset{?}{\overset{?}{}}}=\{ab\}$ such hat every accepted

string start and end with different

symbol.

$(12)$ Design a NFA that accepts allstrings

over the alphabet ${\displaystyle \underset{?}{\overset{?}{}}}$:$\{a,b\},$ such mat

every string $\text{'}$w$\text{'}$ accepted must be like $(12)$ Design a NFA that accepts all strings

ver the alphabet ${\displaystyle \underset{?}{\overset{?}{}}}$:$\{a,b\},$ such that

eveny string $\text{'}\text{'}$ accepted must be like

$($a$)||=3$

$($b$)|w|c=3$

$($c$)||3$

$(13)$ Comert the NFA to its equivatear DFA $?$

$(14)$ Covert the follum NFA to DFA.

$(15)$ How is G$-$NFA different from NFA?

What extra wurk do yeu need to do in G$-$NFA.

compared to NFA?

$(16)$ Convert the following E$-$NFA toits equivat

a$.$ AFA? $(16)$ Convert the following G$-$NFA to its equivat

ent NFA?

ALSO ANSWER $17$ AND $18$ PLEASE