Implement a solution programmatically to the Knapsack problem using a greedy algorithm. Please check below for approved programming languages. The Knapsack problem without repetition is described in section 6.4. There are a plethora of resources on the web (including complete implementations). Please make sure you start from scratch when implementing your algorithm. Please source any common subroutines that you may implement. Please use camelCase as a naming convention for all of your variables. Please use descriptive variable names, if the variable name become lengthy, that just means you're describing it well. Supply a screenshot of your program execution that effectively demonstrates the correct use of your program. Please be sure to include at least 2 problem examples that your code provides a solution for Approved Programming Languages: Python, C#, C++, Matlab Turn-in: 1. A file containing the programming code used for the assignment 2. A screenshot of the execution of the program you created for 2 sample knapsack problems. Please be sure to describe the problem you are solving in detail (via program output or a separate word document)