Eight sets A, B, C, D, E, F, G and H are such that:
A is a superset of B, but subset of C.
B is a subset of D, but superset of E.
F is a subset of A, but superset of B.
G is a superset of D, but subset of F.
H is a subset of B.
N(A), N(B), N(C), N(D), N(E), N(F), N(G) and N(H) are the number of elements in the sets A, B, C, D, E, F, G and H respectively.
If Q and Z are two new sets, both supersets of H, and N(Q) and N(Z) are the number of elements of the sets Q and Z respectively, then:
Two new sets are added here, Q and Z, but both are only pinned down as supersets of H: N(Q) and N(Z) are at least N(H), with nothing said about how big they can get. To find what must be true, line up every set's position using the passage: H and E both sit inside B, and B sits inside D, which sits inside G, which sits inside F, which sits inside A, which sits inside C.
The first two options each name one specific set as the smallest, but the passage leaves the H versus E comparison open, so neither can be asserted with certainty. The third option gets knocked out once the unrestricted Q and Z enter the picture. Only the fourth option survives, because it correctly hedges between the two candidates without needing to know which one wins.
Let's summarize:
So the statement that must be true is that either N(H) or N(E) is the smallest. The answer is option (D).