Can someone solve these for me?

Show that the following regular expressions describe the same language using set and string operations or disprove that they are equivalent by counter example S = {A, B} a) (AB U A)* A = A(BAU A)* (5 points) b) (AU B)*B = (A*B)*B (5 points)