1. **State the problem:** We are given a recurrence relation with initial terms: $$a_1 = -4, \quad a_2 = 5$$ and the recursive formula: $$a_n = -a_{n-1} - a_{n-2}$$ We need to find $a_3$, $a_4$, and $a_5$. 2. **Use the recurrence relation:** Calculate $a_3$: $$a_3 = -a_2 - a_1 = -5 - (-4) = -5 + 4 = -1$$ 3. Calculate $a_4$: $$a_4 = -a_3 - a_2 = -(-1) - 5 = 1 - 5 = -4$$ 4. Calculate $a_5$: $$a_5 = -a_4 - a_3 = -(-4) - (-1) = 4 + 1 = 5$$ 5. **Final answers:** $$a_3 = -1, \quad a_4 = -4, \quad a_5 = 5$$ These values follow directly from the recurrence relation and initial conditions.