Assertion (A): For a sequence defined by the recursive rule \(t_1 = 3\) and \(t_n = 2t_{n-1} + 1\) (for \(n \ge 2\)), the Second term \(t_2\) is \(7\).
Reason (R): An explicit rule allows us to discover any term in a sequence directly without calculating its preceding terms.
