recurrence relation for the functional value of F(n) is given below :
$F(n) = a_{1}F(n-1) + a_{2}F(n-2) + a_{3}F(n-3) + \ldots + a_{k}F(n-k)$
where $a_{i} =$ non zero constant.
Best time complexity to compute F(n) ?
assume k base values starting from F(0), F(1), to F(k-1) as $b_{0} , \ b_{1} \ , b_{2} \ .... \ b_{k-1}$ ; $b_{i} \neq 0$
A. Exponential ( $O(k_{2}r^{k_{1}n})$)
B. Linear ( $O(n)$ )
C. Logarithmic ( $O(\log n)$ )
D. $O(n \log n)$