1. **State the problem:** We are given a sequence defined by the recurrence relation: $$a_1 = 0, \quad a_2 = 1, \quad a_n = a_{n-1} + a_{n-2} \text{ for } n \geq 3$$ We need to find $a_3$, $a_4$, and $a_5$. 2. **Recall the formula:** Each term after the second is the sum of the two preceding terms. 3. **Calculate $a_3$:** $$a_3 = a_2 + a_1 = 1 + 0 = 1$$ 4. **Calculate $a_4$:** $$a_4 = a_3 + a_2 = 1 + 1 = 2$$ 5. **Calculate $a_5$:** $$a_5 = a_4 + a_3 = 2 + 1 = 3$$ **Final answers:** $$a_3 = 1, \quad a_4 = 2, \quad a_5 = 3$$ These are integers and already in simplest form.