Construct regular expressions for the below $$English$$ statements. If you cannot construct one,

explain why that may be the case.

$1.$ Write a regular expression which accepts numbers from $3$ to $145.$

$2.$ Consider a language over the alphabet $\backslash$Sigma $=\{0,1\},$ where all of the strings has length n where

n in $\{2$k $+1|$ k in Z$+($non$-$negative integer$)\}$ and start with $1($e$.$g$.1,110,101,11111,$ etc.$).$

$3.$ Given an alphabet $\backslash$Sigma $=\{$a$,$ b$,$ c$\},$ construct a regular expression that matches strings where

the count of b$$s is precisely twice the count of c$$s and where the count of a$$s is the same as

the count of c$$s $($e$.$g$.,$ babc, cabb, cacbbabb, etc.$).$

$4.$ Given an alphabet $\backslash$Sigma $=\{0,1,2\},$ construct a regular expression for strings with at most one

$1$s and at most one $2$s