Regular expressions

$($a$)$ Give a regular expression for the language that is the set of binary strings that contain the

substring $0101.$

$($b$)$ Give a regular expression for the language that is the set of binary strings that do not contain

the substring $110.$

$($c$)$ Give a regular expression for the language that is the set of binary strings of length at most $5.$

$($d$)$ Give a regular expression for the language that is the set of binary strings that have a $1$ in every

odd position in the string.

$($e$)$ Give a regular expression for the language that is the set of binary strings containing at least two

$0$s and at most one $1.$