There are $20$ boxes numbered $1,2,......20$. Five boxes are selected at random and are arranged in ascending order. In how many ways this can be done so that no. $10$ is present in each selection and it comes in $3rd$ place in the arrangement.?

Question

$\begin{array}{1 1} (A) ^{10}C_2\times ^{10}C_2 \\ (B) ^9C_2\times ^{10}C_2 \\ (C) ^9C_2\times ^{9}C_2 \\ (D) ^{19}C_4 \end{array} $