What is the running time of an unweighted shortest path algorithm whose augmenting path is the path with the least number of edges?

• A. O(|E|)
• B. O(|E||V|)
• C. O(|E|2|V|)
• D. O(|E| log |V|)