What is the time complexity of adding an edge to a graph that is implemented using Adjacency List? This operation adds an edge (u, v) to the graph, if vertices u and v are not in the graph, it adds them as well. V = V U {u} U {v} E= EU {(u, v)} O(n) 0 (na) O 0 O (1) OO(n + m) (n log(n))