NetID:

Modeling Computation

$($a$)(3$ points$)$ Design a Context Free Grammar $G$ such that

$L(G)=\{\begin{array}{c}{b}^n{a}^m{b}^n|m0\end{array}$ and $\{$:$n0\}$

$($b$)$ Given the regular expression

$r=c(c|d)(a|b)b(c|d)c$

i$.(3$ points$)$ List all the strings represented by $r.$

ii$.(3$ points$)$ Draw a NFA$-lon$ that accepts the language represented by $r.$