6. (5 points) Solve the following recurrence relation using the backward substitution as we discussed in the class. In the problem, you should present the intermediate steps and final time complexity of the recurrence relation. F(n) = F(n 1) +5, for n>1 // recurrence relation F(1)=0 // initial condition