Proving following regular expressions equal to one another?
Convert both regular expressions to a DFA, compute the symmetric difference of the two DFA's using a product construction, and then check whether the result accept the non-empty language.  Each of those steps is described here on this site.  See also Does this regular expression equal this automata? for a very similar question.