Consider L = {ab, aa, baa}. Which of the following string is NOT in L*?

Which of the following languages can be recognized by Non-Deterministic Finite Automata (NFA) but cannot be recognized by Deterministic Finite Automata (DFA)?
A. $$L_1 =$$​ {w $$\in$$​ {0, 1} *| the length of w is even}
B. $$L_2 =$$​ {w $$\in$$​ {0, 1} *| the length of w is odd}
C. $$L_3 =$$​ {w $$\in$$​ {0, 1} *| all 0's come before all 1's in w}
D. $$L_4 =$$​ {w $$\in$$​ {0, 1} *| w contains an equal number of 0's and 1's}
E. $$L_5 =$$​ {w $$\in$$​ {0, 1} *| all 1's come before all 0's in w}
Choose the correct answer from the options given below: