I need help solving a computer theory$/$theoretical foundation question. Please follow the question carefully and provide a clear, step$-$by$-$step solution tailored to the problem. If diagrams are required $($e$.$g$.,$ DFA, NFA, computation trees, pushdown automata, etc $),$ draw them clearly with labels and explain each process step so I can easily understand and recreate them on paper. Focus on clarity, simplicity, and ensuring the explanation aligns with the question. Thank you!$5.(20$ points$)(1)$ Draw a state diagram of the NFA accepts the set of all strings that end with substrings aa or bb$.$ The alphabet is $\backslash (\backslash \{\backslash$mathrm$\{$a$\},\backslash$mathrm$\{$b$\}\backslash \}\backslash ).(2)$ Give the regular expression that defines the same language.

$(1)$ Draw the state diagram of the NFA:

$(2)$ Write the regular expression: