Find the distance from source A to destination D using Dijkstra algorithm.

A. A-b-c-j-d-k
B. A-b-c-g-h-d-k
C. A-e-d-k

D. A-e-g-h-d-k

Explanation: Shortest path is: A-E-G-H-D-K and the distance is 5 units.

Occurrence: 0, System Administrator 2026