$[5$ pts$.]$ Consider the following pseudocode for an operation on a digraph ADT $G$ represented using an adjacency matrix structure.Fill in the following table with the operation being performed $($a brief description in a few words$)$ and tight big$-$Oh characterizations of the worst$-$case asymptotic running time and space complexity of the algorithm described in the pseudocode above for the operation as a function of the number of vertices n$.$

$\backslash$table$[[$OpERATION$,$Time,Space$],[,,],[,,]]$