The minimum number of states required to contruct a DFA accepting languages L= { w | w has an even number of both 0's and 2 's , and an odd number of 1's } over the alphabet $\Sigma =\left \{ 0,1,2,3 \right \}$ is _____
please write regular expression also.