Problem 2. 4 points] Use closure properties to prove that the following language is not regular. L = {a"bPck | n=p+k, n > 0, p > 0, k>0}