3. Assume a directed graph G with n vertices and m edges, in which the weight of all edges are equal. Which of the following time complexities is needed to compute the shortest path from a vertex V to every other vertex in G? a. O(nm) b. O(n + m) c. O(n^2) d. O(n log m) e. None of the above