Build a code for me in c# or python

Non-deterministic 0/1 Knapsack solver You need to be alert to (usually minor) changes that may be made to the assignment statement or to the guidelines after the assignment is first put up. Refresh this frame and re-read the assignment carefully before you make your final submission. Assignment statement In the knapsack problem a set of items, each with a mass and a payoff are to be packed in a knapsack which can accomodate a given maximum mass. The aim is to choose the items so as not to exceed the capacity of the knapsack, while maximising the payoff. All of these are given as integers. You are required to read the capacity of the knapsack sequence of <mass, payoff> pairs and determine the choice of items to maximise the payoff without violating the knapsack capacity in the following two ways: [login to view URL] a deterministic technique and [login to view URL] a non-deterministic technique In each case do the following: [login to view URL] the count of execution of the steps where the choices are made and [login to view URL] the choices made and the payoff thus obtained. You need to submit a text report including the following: [login to view URL] of the deterministic problem solution scheme [login to view URL] of the non-deterministic problem solution scheme, including the using of OS primitives that are used and the relevant system calls, and [login to view URL] whether or not the given problem is in the class NP Your report should also contain three example formulae which are satisfiable and three example formulae that are not. These examples are to be developed by you (not taken from anywhere).