Answer : Only $\text{(i)}$ is correct.
- For Fractional Knap Sack we can have Greedy algorithm but that does not give optimal solution for 0/1 Knap Sack .
- Prim’s Algorithm to find MST of graph uses Greedy Approach .
- Traveling Salesman problem can be solved using Dynamic Programming in
$O(2^n.n^2)$