We are given a directed graph G = (V, E) , where V = {1, ... n} , i.e. the vertices are integers in the range 1 to n. For every vertex we would like to compute the values defined as follows: is the smallest such that vertex is reachable from vertex (As a convention, we assume that is reachable from .) Show that the values can be computed in time.