Hello I was having trouble answering this question, could someone help me out?

A landscape contractor has job request, one for each of the next n days and needs to make a schedule. He may not accept all the jobs since it may be to his advantage to give his work crew some days off. The goal is to maximize profit subject to the following rules:

- The expected profit p_i is known for each job, 1 i n. - On returning from having day i 1 off, the crew is so efficient that the actual profit on the next day is 2p_i. - Between any two days off, however, profit will not exceed a certain given number P regardless of the p_i. - Days 0 and n + 1 are considered as days off. Find a dynamic programming solution to this problem. Begin by finding an expression for the optimal profit if day k is assumed to be the last day off before day n + 1