Considering following input Adjacency Matrix with cost that is representing a Graph. Write a C++ program to calculate the minimum cost of each node from node 0. Your program should display cost of each node starting from node 0 after every iteration.

Note:

1. Calculate the cost of node with logical process, dont hard code the values of cost.

2. This should not be a complete executable program. Non executable programs will cost marks

Input: 0 3 4 1 2 0 0 2 3 0 0 1 2 0 15 20 23 15 0 0 13 3 0200 9 W 4 0 0 13 9 0 Sample Output (These values may be incorrect): Nodes Minimum Cost from node 0 O to 0 0 2 0 to 1 O to 2 O to 3 3 4 0 to 4 16