Answer:
Option: C is the correct answer.
C.
Explanation:
Recursive Formula--
It is the formula which is used to represent the nth term of a sequence in terms of (n-1)th term of the sequence.
Here we are given a table of values by:
n f(n)
1 4
2 20
3 100
i.e. when n=1 we have:
![f(1)=4](https://img.qammunity.org/2020/formulas/mathematics/high-school/x9dilkg5jsaurca1n96f146m9of436j5ry.png)
Also,
![f(2)=20\\\\i.e.\\\\f(2)=5\cdot 4\\\\i.e.\\\\f(2)=5\cdot f(1)](https://img.qammunity.org/2020/formulas/mathematics/high-school/ar4ziuukeflqhmvva20ulhoqaz31rode1j.png)
Also,
![f(3)=100\\\\i.e.\\\\f(3)=5\cdot 20\\\\i.e.\\\\f(3)=5\cdot f(2)](https://img.qammunity.org/2020/formulas/mathematics/high-school/ai239sa5muuifu1cdki60h2sppgevt6oy4.png)
Hence, the recursive formula is:
![f(n)=5\cdot f(n-1)\ for\ n\geq 2](https://img.qammunity.org/2020/formulas/mathematics/high-school/2mod5g2gwz76uysdoohgikjynedho3pin8.png)