6) (1 point) With a static adjacency matrix, finding whether two nodes are connected has a time-cost of_______assuming we know their indices within the vertex list.

a)O(v)where v is the number of vertices listed within the vertex list.

b)O(1)

c)O(log(v))

d)None of the above

Inadequate information provided