How many arrangements of the letters in COMBINATORICS have no consecutive vowels?

I have a problem here that I've been mulling over for a while and I can't seem to grasp why the book has a different answer than me.

Here's my attempted solution -

As per "Applied Combinatorics" I noted that it's a "consecutive vowel" problem and immediately went to creating a diagram that looks like below

$$\_v\_v\_v\_v\_v\_$$

Where each _ is a "box". Now, I know there are 5 vowels and 8 consonants, hence the 5 v's.

By doing this I reduced the problem to a "distribute n objects into r boxes with repetition" problem and concluded with the answer

$$\binom{4+6-1}{4}6!5!$$

Which, I suspect, would be the answer if there weren't repeated letters. However, this is wrong and the book lists the answer as:

$$\binom{9}{4} * \frac{8!}{2!} * \frac{5!}{2!2!}$$

Given that the Cs repeat, as well as the O's and I's I'm at a loss as to how to handle this problem (mostly because the example my textbook gives is so trivial it's hard to see beyond it).

Can anyone clear this problem up for me? Thank you!

First, arrange the 8 consonants (with one repeat of a double C) in $\frac{8!}{2!}$ distinct ways.
Now arrange the five vowels, with two repeats, double I, and double O, in $\frac{5!}{2! *2!}$ ways.