Due Thursday, September 19 in class at 2 PM.
Write down the adjacency matrix of the transitive closure of this graph. The entries in the matrix should be 0's and 1's.
Order the nodes alphabetically: a, b, c, d, e, f.