a. Write pseudocode of the bottom-up dynamic programming algorithm for the knapsack problem.
b. Write pseudocode of the algorithm that finds the composition of an optimal subset from the table generated by the bottom-up dynamic programming algorithm for the knapsack problem.