What alternative best describe the language represented by the following regular expression?

$(0)(110{)}^{**}$

Strings that only start with $1.$

Strings do not have $2$ consecutive $1s.$

Strings that consist of alternating $0$ s and $1s.$

Strings do not have $2$ consecutive Os$.$