Consider the language L $=\{$w $|$ w is a sequence of a$$s and b$$s where $|$w$|>=6$ and the first $3$ letters of every string in L are the same as the last $3$ letters in the string$\}.$ 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.