Use the pumping lemma to show that the following languages are not regular (a) (5 pts) {01mon | m, n >0} (b) (5 pts) {www | W E {0,1}*} (c) (5 pts) Let E= {0,1,, =} and SUB {x = y 2 | x, y, z are binary integers, and x is the result of the subtraction of z from y}. For example: 1 =1 0, 10 = 11 01 are strings in SUB but not 1=1 1 or 11 = 11 10