describe the ‘knapsack problem’. Further, compare and contrastthe use of a brute force and a dynamic programming algorithm tosolve this problem in terms of the advantage and disadvantages ofeach. An analysis of the asymptotic complexity of each is requiredas part of this assignment.

thanks