Suppose breadth first search is executed on the graph below starting at some unknown vertex. Assume that a call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible depth of the queue (including the initial call) is _________.
