1) Write a Java program to implement Dijkstra’s algorithm using  pseudocode below function Dijkstra(Graph, source): create vertex set Q for each vertex v in Graph:  // Initialization dist[v] - INFINITY // Unknown distance from source to v prev[v] - UNDEFINED //Previous node in optimal path from source add v to Q / All nodes initially in l (unvisited nodes) dist[source) - o // Distance from source to source while Q is not empty: U - vertex in Q with min dist[u] // Source node will be selected first  remove u from Q for each neighbor v of u: // where v is still in Q. atl - dist[u] + length(u, v)  if alt ‹ dist[v):  // A shorter path to v has been found dist[v] - alt prev[v] - u     return dist[], prev[]    2) The output of the program should be the arrays list and prev. Recalll that list [i] is the distance from the start of the vertex i. prev[I] is the vertex that immediately precedes vertex i on the shortest path from the start vertex to vertex i. 3) The vertices should be numbered as follows; a=0, b=1, c=2, d=3, e=4, f=5, and z=6.

1) Write a Java program to implement Dijkstra’s algorithm using  pseudocode below

function Dijkstra(Graph, source):

create vertex set Q

for each vertex v in Graph:  // Initialization

dist[v] - INFINITY // Unknown distance from source to v

prev[v] - UNDEFINED //Previous node in optimal path from source

add v to Q / All nodes initially in l (unvisited nodes)

dist[source) - o // Distance from source to source

while Q is not empty:

U - vertex in Q with min dist[u] // Source node will be selected first 

remove u from Q

for each neighbor v of u: // where v is still in Q.

atl - dist[u] + length(u, v) 

if alt ‹ dist[v):  // A shorter path to v has been found

dist[v] - alt

prev[v] - u  

return dist[], prev[] 

2) The output of the program should be the arrays list and prev. Recalll that list [i] is the distance from the start of the vertex i. prev[I] is the vertex that immediately precedes vertex i on the shortest path from the start vertex to vertex i.

3) The vertices should be numbered as follows; a=0, b=1, c=2, d=3, e=4, f=5, and z=6.