Dear sir or madam, I need help with this question:

Consider the following language in $\{$a$,$b$,$c$\}.$

$\{$w $|$ every $"$ab$"$ is immediately followed by a $"$c$"\}$

a$.$ Describe a deterministic finite automaton $($DFA$)$ that recognizes the language.

b$.$ Give a nondeterministic finite automaton $($NFA$)$ that recognizes the same language.

c$.$ Give a regular grammar $($linear grammar$)$ to describe this language.

Thank you.