Answer required in written form with all steps performed.

Q5. A) Use Floyd algorithm to find shortest paths from all nodes to all other nodes of the following graph and verify the results by Dijkstra algorithm as well. Show both matrices (path length and path) in each step. 2 2 ml 5 6 5 3