Question Ten 1- Solve the following 0/1 Knapsack problem using dynamic programming 3/4 P= (11, 21, 31, 33), w= (2, 11, 22, 15), with the max weight ofbag is 40 Kg. 2- We are to complete a set ofnjobsusing midentical machines. Eachjob has a known duration. The goal is to schedule the jobs on m machines so that the time to finish the last job is as small aspossible. Once a job is scheduled on a machine, it can'tbe stopped andrestarted. Any job canrun on any machine. A greedy algorithm to solve this problem is as follows: sort jobs in decreasing order of duration. Schedule jobs one by one, choosing the machine where it can start the earliest. 9, 12, 3, 8, 6, 5>, what is the finish For m = 3 and n-6 where the durations are time ofthe last job using geedy schedule? Exhibit an input for which the greedy schedule is NOT optimal. a. b