- Option 1: The intersection of two context free languages is not necessarily context free, as context free languages are not closed under intersection.
- Option 2: Not all context free languages can be accepted by a deterministic push down automaton, as deterministic pushdown automata only accept a subset of context free languages.
- Option 3: The union of two context free languages is indeed context free, as context free languages are closed under union.
- Option 4: The complement of a context free language is not necessarily context free, as context free languages are not closed under complementation.
Therefore, the correct answer is 3. The union of two context free languages is context free.