Let language L contain every binary string w of $\backslash$Sigma $$ that satisfies following properties,

$(1)$ w has both $101$ and $11$ as substrings, $(2)$ the occurrence of $101$ is before the oc$-$

currence of $11.$ For example, $1010011$ in L$,1100101/$ in L since the occurrence of $101$

is after the occurrence of $11.$ Is L a regular language? Please justify your answer