Give a context$-$free grammar to generate each of the following languages:

$($a$)\{\begin{array}{c}{0}^m{110}^n|mn\end{array},$ and $\{$:$m,n2\}$

$($b$)\{\begin{array}{c}uvw{v}^R|u\\ v\\ \text{w}\text{i}\text{n}& \{a,& b{\}}^{+}\end{array}$and $\{$:$|u|=|w|=2\}$

$($c$)$ The set of odd$-$length strings in $\{a,b{\}}^{*}$ with middle symbol a $.$