#### Answer

$90,720$

#### Work Step by Step

Use the theorem for permutations involving $n$ objects that are not distinct, the formula fr which is:
$=\dfrac{n!}{n_1!\cdot n_2! \cdot n_3! \cdot \cdot \cdot n_k}$
In this example, there are $2$ O's and $2$ C's.
Thus, we have $N_1=2$ and $n_2=2$.
Therefore,
Number of words that can be formed = $\dfrac{9!}{2!\times2!} = 90720$.