Question

Sleepy Hollow Park The table, shown to the right,lists trees that are Riverside Park in two city parks. Oak, o Hickory, h Maple, m Birch, b Pine, p Maple, m Pine, p Find the smallest universal set U that contains all listed trees of both parks. Elm, e Oak, o Willow, w Use the letters that correspond to each tree. The smallest universal set U is (Use a comma to separate answers as needed.)

Answer 1

Let U be the universal set i e set which contains all the in U = {maple, pink, elm, oak, willow, hickory, birch} = {m, p, e, o, w, h, b} Similarly each of them can meet into 4 ways to each other. total no. of ways is 5 times 4 = 20 ways {each 4 ways} then A Intersection B = {1} here A Intersection B means what is common between A and B.