Dijkstra's and Prim's algorithms do not always explore or attach nodes in the same order when starting from the same node s. While both algorithms greedily pick the closest node, they do so using different methods - Dijkstra's uses a priority queue while Prim's does not, so the order is not guaranteed to be the same.

1. The order in which Dijkstra's and Prim's algorithm explore (respectively attach) nodes when
starting from the same node s is: Select one: a. Always the same, only if edge weights are non-
negative. b. Always the same, since they both greedily pick the closest node, even without a
priority queue implementation. c. Always the same, since they maintain a priority queue and
greedily pick the closest node. d. Not always the same.