[The main step of the LS algorithm is D(v) = min ( D(v), D(w) + c(w,v) ) in which 'w' is newly added to N' because the value of D(w) is a minimum in the last iteration D(v) is the current shortest path from source 'a' to any node 'v' which has not been in N' ]

Questions:

a) show the operations of Dijkstra's algorithm for computing the least cost path from the node 'a' to all other nodes.

b) Term defination in the algorithm:

answer should be in same format I have filled in table.

C) what is the shortest path from 'a' to 'e'?

4. Dikstra's (link-state) algorithm. Consider the network below a Show the operation of Diksra's algonithm for computing the least cost b. Terms defiration in the algorithm path from the node 'a' to all other nodes Dio): cost of the least-cost path from node a' to node 'v' as of the current teration pto): previous node along the current least-cost path from 'a' to 'v N': subset of nodes, v is in N' if the least-cost path from the source to v is definitely known Your answer should be in the format as (T have illed two cells for you) c What is the shortest path from 'a' to 'e