Prove that the following languages are not regular. You may use the method developed in class $($pumping lema is not allowed$).$

$($a$)(10$ marks$)L=\{w(={?}^{?})w|win\{0,1{\}}^{**}\}.$

$($b$)(10$ marks$)$ The subset of HTML containing only the tags $($:$p$:$)$ and $(\frac{\text{:}}{p}$:$).($Note: $($:$p$:$)$ indicates the begining of a pragraph of text, and $(\frac{\text{:}}{p}$:$)$ indicates the end of it$.$ The $($:$p$:$)$ tags can be nested, example:

$($:$p$:$)($:$p$:$)(\frac{\text{:}}{\frac{?}{?}}p$:$)(\frac{\text{:}}{\frac{?}{?}}p$:$)).$ You may asume there is no text content within paragraph tags.