L$3$ is the language recognized by the NFA.

$(1)$ Give a DFA that recognizes L$3$ and explain.

$(2)$ Give a regular expression for L$3,$ and explain.