Please write a full answer, and give a good explanation

5 We have W pills and n pill bottles of varying sizes, where p is the number of pills that can fit into pill bottle i. The pill bottles have different manufacturing costs, so that the cost of pill bottle i is c. We now want to fit all the Wpills into pill bottles, but at the same time minimize the total cost of the pill bottles used. Use dynamic programming to solve this problem. First show and justify the recursive formula, and then analyze the time complexity. 5 We have W pills and n pill bottles of varying sizes, where p is the number of pills that can fit into pill bottle i. The pill bottles have different manufacturing costs, so that the cost of pill bottle i is c. We now want to fit all the Wpills into pill bottles, but at the same time minimize the total cost of the pill bottles used. Use dynamic programming to solve this problem. First show and justify the recursive formula, and then analyze the time complexity