Consider the language L $=\{$w $|$ w is a sequence of $0$s and $1$s where $|$w$|$ is even and the first and second halves of the string are bitwise opposites$\}.$ w$=011100$ is in L$,$ but w$=1111$ is not in L$.$ Is language L a regular or non$-$regular language? If regular, provide a proof by construction by creating a DFA, NFA or RE for the language. If the language L is non$-$regular, provide a proof by contradiction using the Pumping Lemma and the methods described in class