Let

$${S_1} = \left\{ {(i,j,k):i,j,k \in \{ 1,2,....,10\} } \right\}$$,

$${S_2} = \left\{ {(i,j):1 \le i < j + 2 \le 10,i,j \in \{ 1,2,...,10\} } \right\}$$,

$${S_3} = \left\{ {(i,j,k,l):1 \le i < j < k < l,i,j,k,l \in \{ 1,2,...,10\} } \right\}$$ and

$${S_4} = \{ (i,j,k,l):i,j,k$$ and $$l$$ are distinct elements in {1, 2, ...., 10}.

If the total number of elements in the set S_r is n_r, r = 1, 2, 3, 4, then which of the following statements is(are) TRUE?

An n-digit number is a positive number with exactly digits. Nine hundred distinct n-digit numbers are to be formed using only the three digits 2, 5 and 7. The smallest value of n for which this is possible is