4. Consider the language L = {anbrn I 0 0} = {anbn | n > 0). We know that the language {a"bn 1 We have L-{anpm | nm, n, n 0 is not regular, so since the class of regular languages is closed under complement, L can not be regular (since L regular would imply that {a"bn | n > 0} is regular). b) Does the wrong proof given for a) imply that L is regular? Justify your answer. c) Is L regular? Justify your