Can Floyd's 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.

Algorithm 3.4 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[i][j] = { from vi to vy, if at least one intermediate vertex exists. 0, if no intermediate vertex exists. void floyd 2 (int n, const number W) number Diiii, index PUD) { index, i, j, ki for (i = 1; i