Dynamic Programming Proof:

You are managing a team of expert hackers, and each week you have to choose a job for them to undertake. Suppose there are n weeks and for week i you have to choose between assigning a low stress job with payout / or a high stress job with payout h. The catch is that if you assign a high stress job in week i then you needed to assign no jobs in week i-1 so that your team has time to adequately prepare for the job. Your task is: given a set of payouts ,12, and h,h2. hn, find a schedule that where you choose between doing the low stress job, the high stress job, and no job in each week to get a payout of hk, I, or 0, respectively, such that you produce the schedule with maximum possible payout. Provide your algorithm, prove your algorithm is correct, and state and justify its running time. Prove your algorithm is correct, state and justify the running time. You are managing a team of expert hackers, and each week you have to choose a job for them to undertake. Suppose there are n weeks and for week i you have to choose between assigning a low stress job with payout / or a high stress job with payout h. The catch is that if you assign a high stress job in week i then you needed to assign no jobs in week i-1 so that your team has time to adequately prepare for the job. Your task is: given a set of payouts ,12, and h,h2. hn, find a schedule that where you choose between doing the low stress job, the high stress job, and no job in each week to get a payout of hk, I, or 0, respectively, such that you produce the schedule with maximum possible payout. Provide your algorithm, prove your algorithm is correct, and state and justify its running time. Prove your algorithm is correct, state and justify the running time