Explanation: Shortest path in OSPF is usually computed by Dijkstra’s algorithm. It was proposed by Edsger W. Dijkstra in the year 1956. It is a greedy method algorithm and hence may not guarantee the shortest path every time, but is really fast.
Occurrence: 0, System Administrator 2026