engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Engineering Mathematics Combinatorics Recurrence Relations
The solution to the recurrence relation T(n) = T(n - 1) + n, T(0) = 2 is
1
T(n) = n! + n
2
\(T\left( n \right) = \frac{{{n^2}\; + \;n\; + \;2}}{2}\)
3
\(T\left( n \right) = \frac{{{n^2}\; + \;n\; + \;4}}{2}\)
4
T(n) = n!