Regular Expresssion And NFA

Question

In certain programming languages, comments appear between delimiters such as  (* and  ) .

Let C be the language of all valid delimited comment strings. Such a string in C must begin with ( and end with *)  but have no intervening *) .

For simplicity, assume the alphabet  = {a, b, (, *)}.  

(a)    Provide an NFA that recognizes language C .  

(b)    Present a regular expression that generates  C.