Third time asking this question:

Construct a regular expression that recognizes the following language of strings over the alphabet $\{0,1\}$ :

$\{$w in $\backslash$Sigma $*$ : w contains an even number of occurrences of $0011$ as a substring$\}$ The photo represents the nfa.

This photo represents the NFA. Green circles are accept states

NOTE: $*$The expression CANNOT start with $(0*1*),$ as this would accept the word $0011.$ The regular expression must accept a string that has either $0$ occurrences of the substring or even occurrences only