Describe the context$-$free grammar that describes each of the following languages:

$($a$)$ All strings in $\{0,1{\}}^{**}$ whose length is divisible by $5.$

$($b$)L_{3b}=\{0^i{1}^j{2}^{i+j}|i,j0\}$

$($c$)L_{3c}=\{\begin{array}{c}{0}^i{1}^j{2}^k|i=j\end{array}$ or $\{$:$j=k\}$

$($d$)L_{3d}=\{win\{0,1{\}}^{**}|$#$(01,w)=$#$(10,w)\}($function #$(x,w)$ returns the number of

occurrences of a substring $x$ in a string $w)$