Consider the deterministic finite automaton $($DEA$)$ given by the following transition graph.

$($A$)$Provide four examples of words accepted by the DEA, ensuring that each of the characters $0,1,2,3,$ and $4$ appears in at least one example.

$($B$)$Specify a regular grammar G $=($N$,$ T$,$ P$,$ S$)$ for the DEA that generates its language.

$($C$)$Describe the language generated by the DEA in general by providing a regular expression.