If the breadth-first search (BFS) algorithm is applied to the following graph with vertex A as the start, which of the following is NOT true? Select one: a. Vertex E will be visited when the vertices adjacent to F are visited b. The maximum distance from vertex A to any other vertex that can be reached from A is 2 C. Vertex H will be visited when the vertices adjacent to F are visited d. Vertex G is visited before vertex F