please help me to solve this question

3. 25 points Two dynamic programming algorithms (Knapsack in slide 11 and Knapsackl in slide 15) for the knapsack problem are introduced in class. Implement the two algorithms and compare the space and time used by the algorithms. Note that the space efficiency of Knapsack can be improved. Your answers to this question should include the the following results: (a) The values of Mi, w for each i = 0,1,..,n and w=0,1,.., W for problem instance I = {1,2,3,4,5}, {v} = 3, 12 = 6,03 = 18,24 = 22,05 = 28}, {w} = 3,2 = 4. = 5,. = 6,= 7} and W = 11 to show your program for Knapsack solves the knapsack problem, (b) The contents of AG) for each j = 1,...n for the same instance in (a) to show your program for knapsackl solves the knapsack problem. (c) For a few large problem instances, the memory space used by Knapsack and the memory space used by Knapsackl, a brief comparison of the results on the space used, the running time of the two algorithms and a brief comparison of the running times. The memory space can be either a measured maximum memory size or the maximum number of array elements used by the algorithms. You can randomly generate problem instances. You may include comments to show your tricks to improve the memory space and running time of your implementations. You do not need to submit your program codes