Prove that the following languages over the alphabet, ={0,1,#}, are not regular. b. For any x{0,1}, let c0(x) represent the number of zeroes in x, and c1(x) the number of ones. B={1n#xn1,x{0,1}andc0(x)>norc1(x)>n}