Q:Question:The Floyd-Warshall algorithm fails (does not work correctly) if the input graph has a negativeweight cycle. (a) Draw a small graph with a negative-weight cycle. Demonstrate the result of running Floyd-Warshall on it (show D^(k) for k=1, �, n ). [10pt.] (b) In general, how can you use the output of the Floyd-Warshall algorithm to detect the presence of a negative-weight cycle? Discuss why your approach is correct. [10pt.]