A directed graph has 4 nodes and the following directed weighted edges: weight 1 from node 2 to 1. weight 1 from node 4 to 1. weight 4 from node 1 to 2. weight 3 from node 2 to 3. weight 3 from node 4...

Extracted text: A directed graph has 4 nodes and the following directed weighted edges: weight 1 from node 2 to 1. weight 1 from node 4 to 1. weight 4 from node 1 to 2. weight 3 from node 2 to 3. weight 3 from node 4 to 3. weight 2 from node 1 to 4. weight 3 from node 2 to 4. weight 3 from node 3 to 4. Construct the weight matrix W to represent this graph. Use Floyd Algorithm to find the Distance Matrix D giving the shortest distance from every node to the other nodes.