Please solve these two Questions as soon as possible .

These Question is from the Algorithm course of Computer Science & Engineering subject.

If you give me the exact answer to this question , I promise you , I will upvote.

Please give me the answer as soon as possible . Thank you .

1. Consider the following weighted graph. Apply Floyd warshall algorithm to find all pair shortest path. Show details of your calculation. 3 4 3 8 -4 -5 5 6 1. Consider the following weighted graph. Apply Floyd warshall algorithm to calculate Dij . Show each significant steps of your calculation. 2 1 3 4 4. 5 2 o 4 st 5 6 3 2 4 Weighted Graph