If regular expression R$=0(0$U$1)0,$ then:

L$($R$)$ is the language of all strings over $\backslash$Sigma $=\{0,1\}$ that begin and end with $0$ followed

by any string and ends with another $0.$

L$($R$)$ is the language of all strings over $\backslash$Sigma $=\{0,1\}$ that begin and end with $0.$

L$($R$)$ is the language of all strings over $\backslash$Sigma $=\{0,1)$ that begin and end with $00$