Find algorithms solving specific problems and compare then theirperformances’ tradeoffs in terms of its time complexity. Forexample the knapsack problem compare its performance usingdifferent approaches (three approaches) such as (divide andconquer, dynamic programming, brute force, greedy approach etc.).show which approach solve the problem best.
Expert Answer
An answer will be send to you shortly. . . . .