1) Can Floyds algorithm for the Shortest Paths as shown above be modied to give just the shortest path from a given vertex to another specied vertex in a graph? Please explain your answer.

2) Can Floyds algorithm for the Shortest Paths problem 2 be used to nd the shortest paths in a graph with some negative weights? Please explain your answer.

Floyd's Algorithm for Shortest Paths 2 Problem: Same as in Algorithm 3.3, except shortest paths are also created. Additional outputs: an array P, which has both its rows and columns indexed from 1 to n, where highest index of an intermediate vertex on the shortest path P[10] = from v; to Uj, if at least one intermediate vertex exists. 0, if no intermediate vertex exists. void floyd2 (int n, const number W[] [] , number D101, index P[][]) { index, i, j, ki for (i = 1; i