Suppose we are managing a consulting team of expert computer hackers, and each week we have to choose a job for them to undertake. the set of possible jobs is divided into low-stress and high-stress jobs. if we select a low-stress job for the team in week i, then we get a revenue of li > 0 dollars; if we select a high-stress job, we get a revenue of hi > 0 dollars. the catch, is that in order for the team to take a high-stress job in week i, it is required that they do no job (of either type) in week i − 1; they need a full week of prep time to get ready for the crushing stress level. on the other hand, it is okay for them to take a low-stress job in week i even if they have done a job (of either type) in week i − 1. given a sequence of n weeks, a plan is specified by a choice of "low-stress", "high-stress", or "none" for each of the n weeks, with the property that if "high-stress" is chosen for week i > 1, then none has to be chosen for week i − 1. (it is okay to choose a high-stress job in week 1.) the value of the plan is determined in the natural way: for each i, we add li to the value if we choose "low-stress" in week i, and we add hi to the value if we choose "high stress" in week i. (we add 0 if we choose "none" in week i.) give an efficient algorithm that takes values for l1, l2, . . , n and h1, h2, . . , hn and returns the value of an optimal plan.