data structures using example consider weighted graph given in fig and apply warshall' shortest path algorithm to it figure graph programming example write program to implement warshall' modified algorithm to find the shortest path #include #include #define infinity void read (int mat[ ][ ]int )void display(int mat[ ][ ]int )int main(int adj[ ][ ] [ ][ ]nijkclrscr()printf("\ enter the number of nodes in the graph ")scanf("% "& )printf("\ enter the adjacency matrix ")read(adjn)clrscr()printf("\ the adjacency matrix is ")display(adjn)for( = ; < ; ++for( = ; < ; ++if(adj[ ][ = [ ][jinfinityelse [ ][jadj[ ][ ]for( = < ; ++for( = ; < ; ++