Part $3($continued$)$

Let $M=$ The set of strings over the alphabet $\{a,b\}$ in which every $"$a$"$ is followed by a $"$b$"$

$($Yes$,$ this is the same language as on the previous page$)$

Problem $3$c $(6$ points$)$ Write a regular grammar for M$.$

$($If you write a grammar that is context$-$free but not regular, you will lose $3$ points$)$

Put your answer to Problem $3$c in this box

Scratch area $-$ I WILL NOT GRADE anything written in this box