Recursive language is Closed under union and complement means
if L1 is Recursive language and L2 is Recursive language then L1’ U L2 will be Recursive language,
so both should be same language if they are closed in properties
if Recursive U Recursive enumerable then it may or may not be recursive but it will surely RE (Recursive enumerable)