Formal languages and autoamata question.

Decidability / Undecidability Determine whether the following languages are decidable or undecidable and prove your claim.

= INFINUdFA = { |D, and D2 such that L(D) U L(D2) contains infinitely many strings}