N adjacency matrix for an n-vertex goat, but you are not told what the values of i and j are. Values of i and j, and labels all the vertices according to their type (head, neck, shoulder, hip, front foot or rear foot). Note that because the adjacency matrix has n2 entries, you cannot scan the entire matrix in O(n) time. Explain how your algorithm works.