Rajesh constructs a hexagon using matchsticks. He uses \(6\) matchsticks for \(1\) hexagon and for \(2\) hexagons he uses \(10\) matchsticks.
1. Write the general rule to find the number of matchsticks required for \(n\) hexagons.
2. The matchsticks needed for 29 hexagons is .
Answer variants:
117
119
\(6n\)
\(4n + 2\)
\(4n - 2\)
118