Read the following statements below
For all the below questions consider the graph as simple and has positive weight edges.
(i) Let the cost of the shortest path between two nodes is S.If the weight of every edge in the graph is doubled then weight of the shortest path between the two nodes changes to 2*S.
(ii) Let the cost of the shortest path between two nodes is S . If the weight of every edge in the graph is doubled then, the weight of the shortest path between the two nodes increases by a factor of 2*k, where k is the minimum number of edges used to reach the destination among all such shortest paths.
(iii) We can use Kruskal’s algorithm to find Minimum spanning tree of a directed graph .
How many of the above statements are true.
