Question

If \( A = \{ x : x \text{ is a letter of the word MISSISSIPPI} \} \), then \( n(A) = \)

• A. 4
• B. 8
• C. 9
• D. 11

Hint:

When finding the number of elements in a set, always consider only the distinct elements in the set. Repeated elements are not counted.

Answer 1

The Correct Option is A

The problem asks for $n(A)$, which represents the number of elements (cardinality) in the set A.
The set A is defined as the set of letters in the word MISSISSIPPI.
A set contains only unique elements. We need to list the distinct letters from the word.
The letters in MISSISSIPPI are M, I, S, S, I, S, S, I, P, P, I.
Let's identify the unique letters:
M
I
S
P
The set A can be written in roster form as A = \{M, I, S, P\}.
Now, we count the number of elements in set A.
There are 4 distinct elements in the set.
Therefore, $n(A) = 4$.