Which statement is true (I) The running time of Bellman-Ford algorithm is T (VE) (II) Both Dijkstra’s algorithm and Bellman-Ford are based on performing repeated relaxations (III) The 0-1 knapsack problem is hard to solve?
(A) Only I
(B) Only III
(C) Both I and III
(D) All of these