Fill in the details for the proof, mentioned in lecture, that the class of regular languages is closed under the Kleene star operation. That is: Let $M=(Q,,,q_0,F)$ be a DFA. Find an NFA $N$ which accepts $L(M{)}^{**}.$

SOLUTION:

Find a regular expression for the language has even length

Problems $1-4$ please no Ai