If L and P are two recursively enumerable languages, then they are not closed under

A

Kleene Star L * of L

B

Intersection $$L \cap P$$

C

Union $$L \cup P$$

D

Set difference