Answer Happy

Suppose you are using Dijkstra's algorithm to find the shortest path from A to E. Which of the following statement is/are TRUE about the distances of nodes as calculated by the algorithm (More than one answer may be selected)? 'Distance' of a node is the weight of the current path from A to the node. 2 A (В 10 17 E 5 (D) 6 A. The distance of A is always 0 and will not be updated by the algorithm. B. The distance of E should not no longer be positive infinity once the algorithm updates the distance of E. C. The distance of D is initialised to positive infinity by the algorithm. D. The algorithm terminates immediately once the distance of E is updated. 3