no diagram of a graph is given in the question, just the description of the graph in the question that should be used to solve the question.

4. (10 pts.) Application of DFS We are given a directed graph G=(V.E), where V = {1,...,), i.e. the vertices are integers in the range 1 to n. For every vertex i we would like to compute the value m(i) defined as follows: m(i) is the smallesti such that vertex jis reachable from vertex i. (As a convention, we assume that i is reachable from i.) Show that the values m(1).....m(n) can be computed in O(VI+El) time. (Hintl: Make use of the reverse graph G) (Hint2: You should probably use DFS as a subroutine. Feel free to slightly modify DFS if it helps.)