Graph Algorithms · Easy problem

A graph has vertices $p, q, r, s, t$ and edges $pq, pr, qr, qs, rt, st$. Running a DFS from $p$ that visits each vertex's unvisited neighbors in alphabetical order discovers some back edges (edges to an already-visited vertex that is not the current parent). How many back edges does this DFS find?