Give a context$-$free grammar for each of the following languages $E=\{0,1\}$

Strings that contain no consecutive Os$.$

Strings that contain no consecutive $1s.$

Strings in which $110$ does not occur as a substring.

Strings that contain more Os than Is$.$ For example, for length $3,$ these strings are:

$000,001,010,100.$

Strings that take the form $xy,$ where the substring $x$ has the same length as the

substring $y,$ and $x$ and $y$ are different.