Let L be a regular language dened on the alphabet = {a,b}. Which of the following languages is regular? Prove your answer.

(a) f₂(L) = {a₁a₁a₂a₂ ...a_na_n : a₁a₂ ...a_n L}

(b) f₃(L) = {ww : w L}