Consider the following regular languages:
- $L_1$: Languages that accept strings over $\Sigma = \{a, b\}$, such that length of string is greater than $1$, but multiple of $3$.
- $L_2$: Languages that accept strings over $\Sigma = \{a, b\}$, such that every string contains at most $2 \ a$'s and at most $2 \ b$'s.
- $L_3$: Languages that correspond to following regular expression $R$, where $R= 10+ 0+ 11 0^*1$ over $\Sigma =\{ 0, 1\}$.
Let the number of states in the minimal DFA of $L_1,L_2,L_3$ be $s_1, s_2, s_3$ respectively. Then, which of the following is TRUE?
- $s_1 = s_2 < s_3$
- $s_1 = s_3 < s_2$
- $s_1 < s_2 < s_3$
- $s_1 < s_3 < s_2$