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

I = {a, b} p(pp)*( + p)q + q and p*q

+ 0(0 + 1)* + (0 + 1)* 00(0 + 1)* and ((1*0)*01*)*

(s*ttt)*s* and s*(ttts*)*