Consider a directed, weighted graph G with |V| vertices and |E| edges. What is the worst-case time complexity of listing all the outgoing edges of the vertex that has the most outgoing edges, if G is implemented using an unsorted adjacency list?