I don't know where to begin. What steps should I take to solve each part?

Find the solution to each of these recurrence relations and prove the correctness of your solution using mathematical induction. a_n = -a_n - 1, a_0 = 5. a_n = a_n - 1 + 3, a_0 = 1. a_n = a_n - 1 - n, a_0 = 4. a_n = (n + 1)_a_n - 1, a_0 = 2. a_n = 2a_n - 1 - a_n - 2, a_1 = 1, a_2 = 1. a_n = 2a_n - 1 - a_n - 2 + 1, a_1 = 1, a_2 = 1