If L1 is regular L2 is unknown but L1-L2 is regular ,then L2 must be
(a) Empty set
(b) CFG
(c) Decidable
(d) Regular
The question was asked in an interview for internship.
My doubt stems from Union, Intersection & Complement topic in portion Finite Automata of Automata Theory