Show that the following pairs of regular expressions define the same language over the alphabet

L = {a, b}.

(i) (ab)a and a(ba)

(ii) (a* + b)* and (a + b)*

(iii) (a* + b*)* and (a + b)*