Good afternoon I need help with the following Dynammic Progr

Good afternoon,

I need help with the following Dynammic Programming question.

http://www.chegg.com/homework-help/Algorithm-Design-1st-edition-chapter-6-problem-9E-solution-9780133072525

Any help would be greatly appreciated!

Solution

Here there is to be consider a factor i.e., values of s1,s2,s3,....... are to consider and when any value of x which will be less than the previous x value then reboot the system at that day

Now consider that x2 < x1 in this case at day 2 reboot is to be done for getting maximum number of terabytes rather than the general method So here based on the values of x the day will be decided on which the it is to be reboot. For all the cases including the above given condition will be participated in the reboot decision. If the value is less then that corresponding day will be selected as the day for refresh...