Design an algorithm that given a graph G = (V, E) and a vertex s V, as an input, outputs the distances between s and every other vertex ve V, in time O(n + m) (where | V| = n, |E| = m). Hint: Modify the BFS algorithm presented in class.