This is an algorithm question.
Assuming we have ?? items to invest with a budget of ?? millionsKorean won. Each invested item ?? costs ???? millions and brings acorresponding benefit of ???? millions. Design a dynamicprogramming problem to find a subset of invested items to maximizethe benefit gained.
Expert Answer
An answer will be send to you shortly. . . . .