Which one of the following languages over the alphabet $\{0,1\}$ is described by the regular expression?

$1*(0|$e$)1*(0|$e$)1*$

Hint: $"$e$"$ is the empty string

Group of answer choices

$($D$)$ The set of all strings that begin and end with either $0$ or $1.$

$($A$)$ The set of all strings containing the substring $00.$

$($B$)$ The set of all strings containing at most two $0$s$.$

$($C$)$ The set of all strings containing at least two $0$s$.$