The regular expression defining the language L1 U L2 can be obtained, converting and reducing the previous __ into a __ as after eliminating states. (A) GTG, TG (B) FA, GTG (C) FA, TG (D) TG, REâ–ºCorrect Option Correct Option is: B