recurrence relation of the dynamic programming to get the maximum credits

Question

My problem is I have a fixed time and I must get the highest profit

How can I write recurrence relation for a dynamic program

example for my problem

my tim