If a universal set contains 250 elements, n(A) = 80, n(B) = 120, and n(A ∩ B) = 30, find n(A ∪ B)'

clock

step-by-step explanation:

what's that

well there are two answers for that.

1: you need 120 ones then that will equal up to 120.

2: you could also do one 100 and 2 tens.

those are the answers that i have thought of.

your answer is the frist one

hop i