Classical bottom-up iterative approach for 0-1 Knapsack variation

Question

I am not good at DP and trying to improve with practice over time. I was trying to solve [this][1] problem. Given prices and favor-value of n items, determine the max value