Hello,

Thank you for helping me with this. I need to design an algorithm for the following.

From the table below, I want to find out a set of 7 names that gives the largest sum of marks possible with keeping the total fees less than 4000.

Just to be clear, here is the problem in different words.

Desired output:
Set of 7 names (Name1,Name2,Na me3,Name4,Name5 ,Name6,Name7)th at gives the...