(20 points) Consider a directed graph G with n vertices and m edges, where every node is labeled with a unique number from the set {1,... ,n). For every node u, let min(u) be the smallest label among all the vertices that can be reached from u. Give an O(m+ n) algorithm that computes min(u) for all the vertices of G