warshall is a function that takes an adjacency matrix representation of a di$-$

rected graph. The function performs Warshall's algorithm to compute the tran$-$

sitive closure of the graph, which identifies all reachable nodes. The algorithm

iteratively updates the adjacency matrix to reflect whether there is a path be$-$

tween any pair of nodes, either directly or indirectly, by considering intermediate

nodes.

The function modifies the input matrix in$-$place to represent the transitive

closure, where graph $[$i$][$j$]$ is set to $1$ if there exists a path from node i to node j $.$ If

no path exists, the entry remains $0.$ The input matrix must be square, meaning

it has the same number of rows and columns corresponding to the number of

nodes in the graph. please help me with this in python. thank you

$```$

def warshall$($graph$)$:

Function to compute the transitive closure of a directed graph using Warshall's algorithm.

:param graph: A $2$D list representing the adjacency matrix of the graph.

graph$[$i$][$j$]$ is $1$ if there is a direct edge from node i to node j$,$ otherwise $0.$

:return: None. The function modifies the input graph in$-$place to represent the transitive closure.

Example:

Input:

graph $=[$

$[0,1,1,0],$

$[0,0,0,1],$

$[0,0,0,1],$

$[0,0,0,0]$

$]$

Output:

The graph should be modified in$-$place to:

$[$

$[0,1,1,1],$

$[0,0,0,1],$

$[0,0,0,1],$

$[0,0,0,0]$

$]$

$"!"!$

# TODO: Implement Warshall's algorithm to compute the transitive closure of the graph.

# Hint: Use nested loops to iterate through all pairs of nodes

$```$