Answer:
if number == 1
then
tempSolution= max(l[number],h[number])
else if number == 2 then
tempSolution= max(optimalPlan(1, l, h)+ l[2], h[2])
else
tempSolution= max(optimalPlan(number − 1, l, h) + l[number], optimalPlan(number − 2, l, h) + h[number])
end if
return Value
FindOptimalValue(number, l, h)
for itterator = 1 ! number do
tempSolution[itterator] = 0
end for
for itterator = 1 ! number do
if itterator == 1 then
tempSolution[itterator] max(l[itterator], h[itterator])
else if itterator == 2 then
tempSolution[itterator] max(tempSolution[1] + l[2], h[2])
else
tempSolution[itterator] max(tempSolution[itterator − 1] + l[itterator], tempSolution[itterator − 2] + h[itterator])
end if
end for
return Value[number]
OPtimalPlan(number, l, h, Value)
for itterator = 1 ! number do
WeekVal[itterator]
end for
if tempSolution[number] − l[number] = tempSolution[number − 1] then
WeekVal[number] ”Low stress”
OPtimalPlan(number-1, l, h, Value)
else
WeekVal[number] ”High stress”
OPtimalPlan(number-2, l, h, Value)
end if
return WeekVal
