| Exam Board | Edexcel |
| Module | FD2 AS (Further Decision 2 AS) |
| Year | 2019 |
| Session | June |
| Topic | Dynamic Programming |
2. (a) Find the general solution of the recurrence relation
$$u _ { n + 1 } = 3 u _ { n } + 2 ^ { n } \quad n \geqslant 1$$
(b) Find the particular solution of this recurrence relation for which \(u _ { 1 } = u _ { 2 }\)