Prove that the corresponding language is not regular by using the Pumping Lemma or closure properties of regular languages.

C = {0^n! | n >=0 }