Use proof by induction for the Shortest Path Distance algorithm of graph G where u and in S(u,v) cannot = infinity on graph G

Please help me solve this problem

I need an example of a graph where using Floyd's algorithm to find the shortest path doesn't give the right answer because of negative edge weights

1. Consider the weighted, directed graph containing the following vertices and edges.(Weights are in the parentheses.)Vertices: {A, B, C, D} Edges: {AB(5), BC(3), CA(4), AD(2), DA(4), CB(3)}a. Starting at vertex C, determine the shortest path tree using Dijkstrab. If you were to apply Floyd-Warshall’s algorithm to this tree, would it include the shortest path tree you found using Dijkstra? Why or why not?c. Starting at vertex C, determine the minimum spanning tree using Prim.d. Would Kruskal’s algorithm always result in the same MST as Prim’s? Why or why not?   Please provide graphs if possible.