Question $1$

Consider the language over $=\{0,1\}$ that consists of all strings that do not contain $11.$ Mark the correct statements below. Incorrect marks will reduce your grade. The shortest string in this language is the null string.

One of the shortest strings in this language is $0.$

One of the shortest strings in this language is $1.$

A regular expression that represents this language is $(+1)(0+01{)}^{**}$

A regular expression that represents this language is $(0+1{)}^{**}0(1+0{)}^{**}.$

A regular expression that represents this language is $(0+01{)}^{**}$