Need answer's for:

8. Implement Floyds algorithm for the Shortest Paths problem 2 (Algorithm 3.4) on your system, and study its performance using different graphs. 9. Can Floyds algorithm for the Shortest Paths problem 2 (Algorithm 3.4) be modified to give just the shortest path from a given vertex to another specified vertex in a graph? Justify your answer. 10. Can Floyds algorithm for the Shortest Paths problem 2 (Algorithm 3.4) be used to find the shortest paths in a graph with some negative weights? Justify 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 il Ul- from vi to v if at least one intermediate vertex exists 0, if no intermediate vertex exists. void floyd 2 (int n, const number W number D index Pllll) index i, j, k; for (i 1; i n i++) j++) for (j 1; j n; for 1; for (i 1; i n i++) n; j++) for