Assertion(A): The number of matchsticks needed for the letter "\(U\)" is \(2n + 1\).
 
Reason(R): Total number of matchsticks required for \(36\) letters of "\(U\)" is \(74\).