) Professor Gaedel has written a program that he claims implements Dijkstra’s algorithm. The program produces . and . for each vertex ∈ . Give a (|| + ||)-time algorithm to check the output of the professor’s program. It should determine whether the and attributes match those of some shortest-paths tree. You may assume that all edge weights are nonnegative. [CLRS 24.3-4]

In all honesty, there really is no “work” per say to show. mainly it’s just using the process of elimination. the question is asking which domain(s) would be the most appropriate for the function c(n). n is the number of observed vehicles so right away, 1, 2, and 3 can be eliminated.why? 1, 2 start in the negatives and therefore it is impossible to observe negative cars. so, #4 would be the best answer to the given problem.

The correct answer is 7