DISCRETE MATH

the question is to determine the asymptotic time complexity of this algorithm, with justification?

1. The following question concerns an approach to solving the knapsack problem imperfectly. The algorithms in this problem are examples of what are known as greedy algorithms, which attempt to solve an optimization problem by making a sequence of decisions each of which individually is meant to achieve the optimization desired but may not collectively perform that task. Recall that the goal of the knapsack problem is, given a capacity and a set of n objects of weights w..... Un and values ....Un, find indicator values X1...-Xn (where Xi = 1 if we take object i with us, and Xi = 0 if we leave it behind) such that a =0 is maximized subject to the condition TE Xw; , then end if end for ifr=0 then No unclaimed item found Terminate-true else Claim item r and adjust remaining capacity X: +1; C+C-W. end if end while return x; end function Determine the asymptotic time complexity of this algorithm, with justification. 1. The following question concerns an approach to solving the knapsack problem imperfectly. The algorithms in this problem are examples of what are known as greedy algorithms, which attempt to solve an optimization problem by making a sequence of decisions each of which individually is meant to achieve the optimization desired but may not collectively perform that task. Recall that the goal of the knapsack problem is, given a capacity and a set of n objects of weights w..... Un and values ....Un, find indicator values X1...-Xn (where Xi = 1 if we take object i with us, and Xi = 0 if we leave it behind) such that a =0 is maximized subject to the condition TE Xw; , then end if end for ifr=0 then No unclaimed item found Terminate-true else Claim item r and adjust remaining capacity X: +1; C+C-W. end if end while return x; end function Determine the asymptotic time complexity of this algorithm, with justification