Time complexity to check if an edge exists between two vertices would be ___________?Group of answer choicesO(E)O(V*V)O(V+E)O(1)

The time complexity to check if an edge exists between two vertices depends on the data structure used to implement the graph.

1. If the graph is implemented using an adjacency matrix (a 2D array), then we can check if an edge exists between two vertices in constant time, O(1). This is because we can directly access the cell at the intersection of the row and column corresponding to the two vertices.

2. If the graph is implemented using an adjacency list (a list of lists), then in the worst case, we might have to traverse all the vertices connected to a given vertex to check if an edge exists. This would take O(V) time, where V is the number of vertices.

3. If the graph is implemented using an edge list (a list of pairs of vertices), then in the worst case, we might have to traverse all the edges in the graph to check if a particular edge exists. This would take O(E) time, where E is the number of edges.

So, the time complexity can be O(1), O(V), or O(E) depending on the implementation.