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

explain why that may be the case.

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

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

nin$\{\begin{array}{c}2k+1|kin{Z}^{+}\end{array}($non$-$negative integer$)$