Suppose that a graph G = (V,E) is implemented using adjacency lists. What is the complexity of a breadth-first traversal of G? (A) O(|V |^2) (B) O(|V | |E|) (C) O(|V |^2|E|) (D) O(|V | + |E|)â–ºCorrect Option Correct Option is: B