The computation of the shortest path in OSPF is usually done by

• A. Bellman-ford algorithm
• B. Routing information protocol
• C. Dijkstra’s algorithm
• D. Distance vector routing