Suppose $=\{0,1\},$ write a language denoted by the following regular expressions.

$0(0|1)*0$

all strings with $0$ and $1$ that starts with $0$ and end with $0$

all strings with $01$ that starts with $0$ and end with $0$

all strings that starts with $0$ and end with $0$

None of the abov