$(3$ points$)$ Question $3$: The following regular expression describes what language?

$($Note: $=\{0,1\}).$

${}^{**}010{}^{**}$

a$.)$ All strings that contain exactly two $0$ s and exactly one $1$

b$.)$ All strings that contain at least two $0$ s and at least one $1$

c$.)$ All strings with more $0s$ than $1s$

d$.)$ All strings that start with $010$ or end with $010$

e$.)$ All strings of length at least $3$ containing $010$ as a substring

f$.)$ All strings of length at least $5$ containing $010$ as a substring

g$.)$ All strings over the alphabet $\{0,1\}$

h$.)$ All strings of odd length over the alphabet $\{0,1\}$