Prove that the following languages over the alphabet {a, b} are not regular:

b) L = {a^nb^na^n|n 0}

c) L = {a^i b^n|i,n 0,i =n or i = 2n}

d) L = { ww|w is any string}