Concept:
For two sets \(A\) and \(B\), the formula is:
\[
n(A\cup B)=n(A)+n(B)-n(A\cap B)
\]
This formula helps us find unknown elements if sufficient data is available.
Step 1: Checking Statement (I).
Given:
\[
n(A\cup B)=30
\]
Also,
\[
n(A)=15
\]
Substituting:
\[
30=15+n(B)-n(A\cap B)
\]
Here, \(n(B)\) and \(n(A\cap B)\) are both unknown.
So, Statement (I) alone is not sufficient.
Step 2: Checking Statement (II).
Given:
\[
n(A\cap B)=8
\]
But \(n(B)\) is still unknown and \(n(A\cup B)\) is unknown.
So, Statement (II) alone is not sufficient.
Step 3: Checking both statements together.
Using:
\[
n(A\cup B)=n(A)+n(B)-n(A\cap B)
\]
Substitute values:
\[
30=15+n(B)-8
\]
\[
30=7+n(B)
\]
\[
n(B)=23
\]
Thus, \(n(B)\) can be uniquely determined.
Hence, both statements together are sufficient.