Which of following problems cannot be solved using greedy approach?OptionsMinimum spanning tree problemHuffman code problem0-1 knapsack problemSingle source shortest path problem

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

A greedy algorithm for the minimum spanning tree problem is to start with any vertex and then repeatedly add the edge with the smallest weight that does not create a cycle. Which of the following is NOT true about this algorithm?OptionsIt may not produce the minimum spanning tree if the graph contains negative weights.It is always efficient.It always produces a minimum spanning tree.It may not produce the minimum spanning tree if the graph contains cycles

The minimal spanning tree problem determines the:Group of answer choicesminimum total branch lengths connecting all nodes in the network.maximum amount that can be transported along any one path.minimum amount that should be transported along any one path.shortest distance between a source node and a destination node.

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 preferred to be solved using dynamic programming?1 point0/1 KnapsackMatrix Chain MultiplicationFractional KnapsackCoin change