PLEASE SOLVE THIS PROBLEM USING DYNAMIC PROGRAMMING !!!!!!!!

PLEASE SOLVE THIS PROBLEM USING DYNAMIC PROGRAMMING !!!!!!!!

Question 3. An electronic device consists of three components. The failure of at least one component causes the failure of the device. The reliability (probability of no failure) of the device can be improved by installing one or two standby units of each component. The following table charts the reliability, r, and the cost, c. The total capital available for the construction of the device is 10,000 dollar. How should the device be constructed to have maximum reliability? (Remark: The reliability of the device is equal to the multiplication of the individual reliabilities of the components, that is, rir2r3.) Solve this problem using dynamic programming. Clearly state your function, initial or ending conditions, and the recursive relationship. Report the optimal solution as well as the optimal value. Hint: Let f(d) be the maximum reliability with components k and an available capital of d dollars. Component 1 Component 2 Component 3 C($) 2 units c (8) 13 c3($) 1 0.6 1000 0. 7 3 000 0.5 2000 0.8 2000 0.8 5000 0.7 4000 0.9 3000 0.9 6000 0.9 5000 No of parallel 3 Question 3. An electronic device consists of three components. The failure of at least one component causes the failure of the device. The reliability (probability of no failure) of the device can be improved by installing one or two standby units of each component. The following table charts the reliability, r, and the cost, c. The total capital available for the construction of the device is 10,000 dollar. How should the device be constructed to have maximum reliability? (Remark: The reliability of the device is equal to the multiplication of the individual reliabilities of the components, that is, rir2r3.) Solve this problem using dynamic programming. Clearly state your function, initial or ending conditions, and the recursive relationship. Report the optimal solution as well as the optimal value. Hint: Let f(d) be the maximum reliability with components k and an available capital of d dollars. Component 1 Component 2 Component 3 C($) 2 units c (8) 13 c3($) 1 0.6 1000 0. 7 3 000 0.5 2000 0.8 2000 0.8 5000 0.7 4000 0.9 3000 0.9 6000 0.9 5000 No of parallel 3