draw a 3-node directional-completed K3 graph and create the neighborhood matrix A. If the graph is a 3-node directional-cost completed graph, what would the neighborhood matrix look like? Compare with the first one.