Assertion(A): A number written as \(2C1\) can be a disguised multiple of \(9\) depending on the value of \(C\).
 
Reason(R): If the sum of the digits is divisible by \(3\), then the number is divisible by \(3\).