If $C(n, 8) = C(n, 6)$,find $C(n, 2)$.

Let $n > 2$ be an integer. Suppose that there are $n$ Metro stations in a city located along a circular path. Each pair of stations is connected by a straight track. Further,each pair of nearest stations is connected by a blue line,whereas all remaining pairs of stations are connected by a red line. If the number of red lines is $99$ times the number of blue lines,then the value of $n$ is

There are three bags $B_1$,$B_2$,and $B_3$ containing $2$ Red and $3$ White,$5$ Red and $5$ White,and $3$ Red and $2$ White balls respectively. $A$ ball is drawn from bag $B_1$ and placed in bag $B_2$,then a ball is drawn from bag $B_2$ and placed in bag $B_3$,then a ball is drawn from bag $B_3$. The number of ways in which this process can be completed,if the same colour balls are used in the first and second transfers (Assume all balls to be different) is

The number of four-digit numbers strictly greater than $4321$ that can be formed using the digits $0, 1, 2, 3, 4, 5$ (repetition of digits is allowed) is

Numbers greater than $1000$ but not greater than $4000$ which can be formed with the digits $0, 1, 2, 3, 4$ (repetition of digits is allowed),are

On the sides $AB, BC, CA$ of a $\Delta ABC$,$3, 4, 5$ distinct points (excluding vertices $A, B, C$) are respectively chosen. The number of triangles that can be constructed using these chosen points as vertices are: