Only using the closure properties , prove that the following language is not regular: L = {w | w = 0^a1^b where a 0, b 0 and a is not equal to b}