Solve the problem.
-An adventure travel company has reservations from four people (Lee, Maria, Nancy, and Pablo)for its white water rafting trip on June 1st. However the company knows that any of these people may Fail to show up on the day of the trip. Denoting these four people by l, m, n, p, list all possibilities
For the group of people who show up on June 1st for the rafting trip (ie list all possible subsets of
{l, m, n, p}).
A)

\{ 1 \} , \{ m \} , \{ n \} , \{ p \} , \{ 1 , m \} , \{ 1 , n \} , \{ 1 , p \} , \{ m , n \} , \{ m , p \} , \{ n , p \} , \{ 1 , m , n \} , \{ 1 , m , p \} , \{ 1 , n , p \} , \{ m , n , p \} , \{ m

\mathrm { n } , 1 \} , \{ 1 , \mathrm {~m} , \mathrm { n } , \mathrm { p } \}

\varnothing , \{ 1 \} , \{ m \} , \{ n \} , \{ p \} , \{ 1 , m \} , \{ 1 , n \} , \{ m , n \} , \{ m , p \} , \{ n , p \} , \{ 1 , m , n \} , \{ 1 , m , p \} , \{ 1 , n , p \} , \{ m , n , p \}

\varnothing , \{ 1 \} , \{ m \} , \{ n \} , \{ p \} , \{ 1 , m \} , \{ 1 , n \} , \{ 1 , p \} , \{ m , n \} , \{ m , p \} , \{ n , p \} , \{ 1 , m , n \} , \{ 1 , m , p \} , \{ 1 , n , p \} , \{ m , n , p \}

\{ 1 , m , n , p \}

\{ 1 \} , \{ m \} , \{ n \} , \{ p \} , \{ 1 , m \} , \{ 1 , n \} , \{ 1 , p \} , \{ m , n \} , \{ m , p \} , \{ n , p \} , \{ 1 , m , n \} , \{ 1 , m , p \} , \{ 1 , n , p \} , \{ m , n , p \} , \{ 1

\mathrm { m } , \mathrm { n } , \mathrm { p }

Let U = {All Soda Pops}, a = {All Diet (A−D)∩B( A - D ) \cap B(A−D)∩B

Multiple Choice

Correct Answer:VerifiedUnlock this answer nowGet Access to more Verified Answers free of chargeAccess For Free

Let U = {All Soda Pops}, a = {All Diet $( A - D ) \cap B$

Correct Answer:
Verified
Unlock this answer now
Get Access to more Verified Answers free of charge