3. (6 points) Shortest Path

a) Describe Dijkstra's Algorithm. Use the alphanumeric conventions for ordering of the vertices and start the algorithm at the smallest vertex. b) Write pseudo code or code to perform Dijkstra's algorithm on a graph c) Why is Dijiktra's algorithm called a greedy algorithm d) Can you write a greedy algorithm for a depth rst search? Yes or no, and explain your answer

3. (6 points) Shortest Path a) Describe Dijkstra's Algorithm. Use the alphanumeric conventions for ordering of the vertices and start the algorithm at the smallest vertex. b) Write pseudo code or code to perform Dijkstra's algorithm on a graph c) Why is Dijiktra's algorithm called a greedy algorithm d) Can you write a greedy algorithm for a depth first search? Yes or no, and explain your