Find grammars for $=\{a,b\}$ that generate the sets of

$($a$)**$ all strings with exactly two $a\text{'}$s$.$

$($b$)$ all strings with at least two $a^{\text{'}}\text{'}$s$.$

$($c$)$ all strings with no more thanthree $a\text{'}$s$.$