To convert a sentence to a CNF$,$ there are usually four steps, and each step is based on a logic equivalence. Convert C $>($A $V$ B$)$ into CNF in the following steps. You need to show the transformed sentence at each step.

$C>(AvvB)$

Step $1$: drop biconditionals

Step $2$: drop implications

Step $3$: move "not" inwards

Step $4$: move $"$or$"$ inwards and "and" outwards