The set, $\displaystyle A$, contains numbers: $\displaystyle \{1,2,\text{...},n\}$.

The set, $\displaystyle B$, contains any subset of $\displaystyle A$ with cardinality $\displaystyle 2$: $\displaystyle \{\{1,2\},\{1,3\},\text{...},\{n-1,n\}\}$

$\displaystyle C_1,C_2,C_3$ are some pairwise disjoint sets that satisfy $\displaystyle C_1\cup C_2\cup C_3=B$.

The set, $\displaystyle D$, contains any subset of $\displaystyle B$ with cardinality $\displaystyle i$, whose elements are pairwise disjoint. With $\displaystyle n=20, i=4$, it looks like this:

$\displaystyle \{\{\{1,2\},\{3,4\},\{5,6\},\{7,8\}\},\{\{1,2\},\{ 3,4\},\{5,6\},\{7,9\}\},\{\{1,2\},\{3,4\},\{5,6\}, \{7,10\}\},\text{...} \}$

I need to figure out:

1. How many elements of $\displaystyle D$ contains at least one element of $\displaystyle C_3$

2. How many elements of $\displaystyle D$ contains no element of $\displaystyle C_3$ and $\displaystyle k$ elements of $\displaystyle C_2$

For $\displaystyle k=0,1, \text{...} ,i$.

Since any element of $\displaystyle D$ is element of exactly one of the above described sets, the sum is the same

as the cardinality of $\displaystyle D$. With $\displaystyle (a)_i$ being the pochhammer symbol, $\displaystyle |D|$ is:

$\displaystyle \frac{2^i \left(1-\frac{n}{2}\right)_i \left(\frac{3}{2}-\frac{n}{2}\right)_i}{i!}$

I need to look through and count some stuff of $\displaystyle C_1,C_2,C_3$ to obtain what's needed to determine the result,

but I have no freaking idea about what and how to use it.. any ideas please?