For show that the following pairs of regular expressions define the same language over the alphabet Σ = {a b} :

(i) (ab)*a and a(ba)*
(ii) (a* + b)* and (a + b)*
(iii) (a* + b*)* and (a + b)*