n the Java programming language, multiline comments appear between

the delimiters $/*$ and $*/.$ Let C be the language of all valid multiline comment strings.

A member of C must begin with $/*$ and end with $*/,$ but have no intervening $*/.$ For

simplicity, assume that the alphabet for C is $\backslash$Sigma $=\{$a$,$ b$,$ c$,/,\}.$ Please draw a DFA

that recognizes C$.$

$5.(5$ points$)$ Given the following DFA. Construct a grammar G that generates all strings

that the DFA should recognize. Assume that $\backslash$Sigma $=\{0,1\}.$

$6.(5$ points$)$ Describe the language L based on the following grammar G $=($V$,\backslash$Sigma $.$R$,$ S$),$

where V $=\{$S$,$ A$,$ B$,$ C$\},\backslash$Sigma $=\{$a$\},$ R $($which is provided below$),$ starting variable S$.$

Based on your answer, please include a short description of what led to you to the

conclusion in order to receive potential full credit on this question.

S $->$ A $|$ B $|$ C

A $->$ aaaaA $|$ a

B $->$ aaaaB $|$ aa

C $->$ aaaaC $|$ aaa

$2$ of $2$