Please Anwser question b and c

2. Prove the each of the following languages are not regular. You may use the pumping lemma, or closure properties of the regular langauges. (a) (5 MARKS) {0"1"O" | m, n >0} (b) (5 MARKS) {0"1" | m #n} (c) (5 MARKS) {www w.u {0,1}+} (HINT: One way to do this is to use closure under intersection to get a simpler pumping lemma proof.) 2 (BMD ) Lotho longo L l uc 1* ramulor? If it in i romulonorogion