Hi, I am having issues understanding how to do go about solving these problems in my algorithms course. Thanks!

Assume we have an unlimited number of coins of each of the denominations 35, 15, 5, and 1. - What coins are dispensed by the greedy algorithm for the amount 45? - Find a different solution for the amount 45 that uses the same number of coins. Solve the activity selection problem for the activities listed below: i 1|2|3|4| 5 | 6 | 7 | 8 | 9 | s[i 1 3 5 7 9 11 13 15 17 fil 2 5 8 8 14 14 15 29 21 . 0-1 Knapsack: Given items with the following weights and values: w = [12, 1, 2, 1.4) v = [4, 2, 2, 1, 10) Use two different greedy techniques we discussed in class to approximate the optimal value of your knapsack if you are limited to a total weight W = 16