$1.$ Write the regular expression for the regular language L over alphabet $\backslash$Sigma $=\{0,1\}$ consisting of strings which contain exactly three $1\text{'}$s or exactly four $1\text{'}$s$.2.$ Write a regular expression that will match a non$-$negative real number with an optional decimal part.