$.$ Let $\backslash$Sigma $=\{0,1\}$ and A $=\{$w $|1001$ is a substring of w and $0110$ is not a substring of w$\}.$ Is A a regular language? Justify your answer. use pumping lemma