MadeEasy Test Series : Regular Expression

Question

Consider the following regular expressions:
I. 0(0+1)*
II. 0* 10*1(0 +1)*
III (0+10)*(1+€)
IV.[(0*10* 10*)* +0*]10*
A language L whose regular expression is r is said to be reverse isomorphic if L(r)= L(r^R). How many of the above regular expressions are reverse isomorphic?

Comments

Yes. It is rev isomorphic as well. Odd number of 1s.

---

@Lakshay Kakkar thanks bro!!

---

What was the answer? I feel following:

L1^R = (0+1)*0
L2^R = (0+1)*10*10*
L3^R = (1+e)(0+01)*
L4^R = 0*1[0*+(0*10*10*)*]

L1 can have strings ending with 1, but L1^R cannot, so not reverse isomorphic.

Cant find such things for rest. So I guess answer is 3. What was the solution?