Continuous knapsack problem is also called as __________________.a.Divisible knapsack problemb.Fractional Knapsack problemc.Non continuous Knapsack problemd.0/1 Knapsack problem

Given a Fractional knapsack problem, the preferred way of solution strategy will be

The main time taking step in fractional knapsack problem is ___________ Options Breaking items into fraction Adding items into knapsack Sorting Looping through sorted items

Given a Fractional knapsack problem, the preferred way of solution strategy will be1 pointBrute ForceDynamicGreedyAny one of these

Fractional knapsack problem is solved most efficiently by which of the following algorithm?Question 4Answera.Backtrackingb.Greedy algorithmc.Dynamic programmingd.Divide and conquer

Which of the following problems is NOT solved using dynamic programming? 0/1 knapsack problem Matrix chain multiplication problem Edit distance problem  Fractional knapsack problem