Hello...
Let A, B, and C be subsets of a universal set U and suppose n(U) = 200, n(A) = 26, n(B) = 28, n(C) = 32, n(A intersection B) = 6, n(A intersection C) = 9, n(B intersection C) = 14, and n(A intersection B intersection C) = 4. Compute:
(a) n[A intersection (B union C)]
(b) n[A intersection (B union C)c]
Any help trying to help me understand this...my teacher has been absent and the substitute teacher has no idea what she is talking about I'm pretty sure and our book doesn't explain it well at all...Thanks!
Let A, B, and C be subsets of a universal set U and suppose n(U) = 200, n(A) = 26, n(B) = 28, n(C) = 32, n(A intersection B) = 6, n(A intersection C) = 9, n(B intersection C) = 14, and n(A intersection B intersection C) = 4. Compute:
(a) n[A intersection (B union C)]
(b) n[A intersection (B union C)c]
Any help trying to help me understand this...my teacher has been absent and the substitute teacher has no idea what she is talking about I'm pretty sure and our book doesn't explain it well at all...Thanks!