Consider the following statements:
(i) A greedy algorithm developed for the fractional Knapsack problem may not work for the 0/1 Knapsack problem.
(ii) Prim's algorithm to find the MST of a graph uses dynamic programming.
(iii) Traveling salesman problem can be solved in O(n2) time using dynamic programming.
Which of the above statement/s is/are correct?
1
(i) only
2
(i) and (iii) only
3
(ii) only
4
All are incorrect
5
Question Not Attempted