please draw the dfa diagram on paper and thank youQuestion $1[30\%]$

Give a regular expression to describe the language that includes strings over the alphabet $\{a,b,c\},$ where strings have length at least four and

in the last four symbols either of the substrings aa or cc occurs. So$,$ the strings aabaccbbaa, boccb and aacc are in the language but acac and

bbbbbabbc are not.

Draw the diagram for a DFA that accepts all strings over the alphabet $\{t,u,v,w\}$ such that all occurrences of symbols in $\{t,u\}$ happen before

any occurrences of the symbols in $\{v,w\},$ and the number of $v^{\text{'}}s$ and $w^{\text{'}}s$ are each even.

Hint: First consider the case of detecting $\{v_{r}w\}$ in various ways, making sure they're each even. Then add in $\{t,u\},$ making sure that any

occurrences come before the $\{v,w\}.$ Finally, remember that the empty string must be considered.