Construct a regular expression for the below expression, if it cannot be consturcted explain why. : 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$

$,$

$1$

$1$

$0$

$,$

$1$

$0$

$1$

$,$

$1$

$1$

$1$

$1$

$1$

$,$

$$etc$.$

$)$

$.$