For each subset it can either contain or not contain an element. For each element, there are 2 possibilities. Multiplying these together we get 27 or 128 subsets. For generalisation the total number of subsets of a set containing n elements is 2 to the power n.

Please mark as the Brainliest Answer and give thanks to my all questions.

There are four elements in the set, and: The number of ways of selecting 0 elements from 4 = 4C0 = 1. The number of ways of selecting 1 element from 4 = 4C1 = 4. The number of ways of selecting 2 elements from 4 = 4C2 = 6.

## Answers ( )

Answer:For each subset it can either contain or not contain an element. For each element, there are 2 possibilities. Multiplying these together we get 27 or 128 subsets. For generalisation the total number of subsets of a set containing n elements is 2 to the power n.

Please mark as the Brainliest Answer and give thanks to my all questions.

There are four elements in the set, and: The number of ways of selecting 0 elements from 4 = 4C0 = 1. The number of ways of selecting 1 element from 4 = 4C1 = 4. The number of ways of selecting 2 elements from 4 = 4C2 = 6.