Consider a directed, weighted graph G with |V| vertices and |E| edges. What is the worst-case time complexity of determining whether G contains an edge between vertices u and v (in either direction), if G is implemented using an unsorted adjacency list?