Question 1 • Mathematical Models with Applications - MA4072 CR
The Fibonacci sequence is defined recursively: each term after the first two is found by adding the two terms before it. For example, 1, 1, 2, 3, 5, where 2 = 1 + 1 and 3 = 2 + 1. So the correct choice is “recursive.”
AI-written and checked against the verified answer.