Which of the following statements apply to Dijkstra's algorithm?
What is the maximum number of iterations in Dijkstra's algorithm when applied to a graph with an order of n?
What is the routing table obtained using the Dijkstra algorithm from vertex 0 on the following graph?

Only the second row of the table is shown. The first row is [0, 1, 2, 3, 4].
Given an input size n, the complexity of an algorithm is exactly 3n² + 4n + 17 elementary operations. Which of the following big-O notations are valid? (recall that O() means that it is at most of the order of so it holds that n = O(n⁵) for example).
Consider an algorithm that operates on graphs. The number of elementary operations it requires is exactly the number of edges in the graph. What is the complexity of the algorithm, expressed as a function of the order n of the graph?
Consider a min-heap with (key,value) couples (A, 5), (B, 3), (C, 7). What is the minimum number of operations (add-or-replace or remove) to obtain the configuration (B, 8), (C, 7)?