B. The transitive closure or reachability matrix of a graph is a (0,1)-matrix whose entry T[i,j] is 1 if there is a path between vertex i and vertex j and 0, otherwise. T[i,j] is 1 since there is a trivial path from every vertex to itself. Complete the transitive closure of the graph whose incidence matrix is shown below. [5 points]
\begin{bmatrix} 67 & 73 & 12 & -32 & 0 & 0 & 0 & 0 \ -67 & 0 & 0 & 32 & -13 & 0 & 0 & 0 \ 0 & 0 & 0 & 0 & 13 & 45 & -35 & -76 \ 0 & -73 & 0 & 0 & 0 & -45 & 35 & 0 \ 0 & 0 & -12 & 0 & 0 & 0 & 0 & 76 \ \end{bmatrix}
Corresponding Transitive Closure Matrix