(Pinedo, ex 3.22) Consider the problem 1 chainsw; (1 e-rC;), where r is the discounting factor (a positive constant). Describe an al- gorithm that solves this problem and prove that it results in an optimal sequence. Hint: You can develop an algorithm inspired by the algorithm for 1 chains w;C; Another hint: For 1|| ; W;(1-e-rC;) the Weighted Discounted Shortest Professing Time (WDSPT) rule is optimal, i.e., processing the job with the largest wje value. -TP 1 rpi (Pinedo, ex 3.22) Consider the problem 1 chainsw; (1 e-rC;), where r is the discounting factor (a positive constant). Describe an al- gorithm that solves this problem and prove that it results in an optimal sequence. Hint: You can develop an algorithm inspired by the algorithm for 1 chains w;C; Another hint: For 1|| ; W;(1-e-rC;) the Weighted Discounted Shortest Professing Time (WDSPT) rule is optimal, i.e., processing the job with the largest wje value. -TP 1 rpi