Assertion(A): The number of matchsticks needed for the letter "\(U\)" is \(3n\).
 
Reason(R): Each additional letter shares one common side and adds only \(2\) matchsticks.