Let L1 and L2 be regular languages. Is the language L={w: w∈L1, wr∈L2} necessarily regular?

A) Yes
B) No
C) It depends on the specific languages L1 and L2
D) It depends on the length of the strings in L1 and L2