Show that the following identities hold for regular expressions over any alphabet: epsilon + R*R = R* 2.

Show that the following identities hold for regularexpressions over any alphabet:1. epsilon + R*R = R*2. (R*S*) = (R + S)*These should be done by interpreting the regular expressions as languages (i.e. sets of words) and arguing that the sets are equal. The proofs do not have to be formal proofs by induction; a compelling argument will suffice.