Professor gaedel has written a program that he claims implements dijkstra’s algorithm. the program produces v. d and v.π for each vertex v  v . give o(v+e)- time algorithm to check the output of the professor’s program. it should determine whether the d and π attributes match those of some shortest-paths tree. you may assume that all edge weights are nonnegative.