For any set S, let ∣S∣ denote the number of elements in S, and let n(S) be the number of subsets of S, including the empty set and the set S itself. If A, B and C are sets for which n(A) + n(B) + n(C) = n(A \cup B \cup C) \text{and} |A| = |B| = 100, then what is the minimum possible value of ∣A∩B∩C∣?<spanclass=′latex−bold′>(A)</span>96<spanclass=′latex−bold′>(B)</span>97<spanclass=′latex−bold′>(C)</span>98<spanclass=′latex−bold′>(D)</span>99<spanclass=′latex−bold′>(E)</span>100