I need your help

This is the problem I'm having.

3. Modify Algorithm 6.1 to produce an optimal set of items. Compare the performance of your algorithm with that of Algorithm 6.1.

float bound ( node u) index j, k; int totweight; float result ; if ( n. weight >= W) return 0: result = u. profit; j = u. level + 1; totweight = u. weight; while (j marprofit) marprofit = u. profit: if ( bound(u) > maxprofit) enqueue( Q, u); u. weight = v. weight; // Set u to the child that u. profit = c. profit: 11 does not include the If ( bound(u) > maxprofit) 11 next item. enqueue ( Q, u);\f