$1.$ Consider the knapsack problem with the following type of items, their costs, and profits $($check image$)$

Write a program that receives as input w$,$ n$1,$ n$2,$ and n$3.$ w is the maximum weight allowed, n$1$ is the maximum number of items of type $1$ allowed, n$2$ is the maximum number of items of type $2$ allowed, and n$3$ is the maximum number of items of type $3$ allowed. The algorithm must return the optimal solution to the knapsack problem. $($LO $3\mathrm{.}5)$

$2.$ Write your solution pseudocode $($after you written down the solution, repeat it in pseudocode$)$