Hello, I've had some confusion about the Coin Change Problem and also the Knapsack Problem recently and I was wondering if I could have some clarifications. 1. With the tables used in order to develop a solution that uses Dynamic Programming, would you have to first calculate the entire table with all entries and then get the solution or is there a more optimal way of approaching this? 2. Why is it that the Coin Change Problem and the Knapsack Problem have different formulae? Is the logic completely dependent on the problem itself and will we be required to develop our own logic for problems like such with slight variations in this unit? Thank you.