Dijkstra’s algorithm may not terminate if the graph contains negative-weight edges

a) false. it always terminates after |e| relaxations and |v|+|e| priority queue operations, but may produce incorrect results.
b) true. it may not terminate and if it does after |e| relaxations and |v|+|e| priority queue operations, it may produce incorrect results.
c) true. it can never terminate as the negative-weight edges continuously reduce the shortest path weight even after |e| relaxations and |v|+|e| priority queue operations.
d) false. it can surely terminate as long as the negative-weight edges are not considered for the shortest path weight calculation among those |e| relaxations and |v|+|e| priority queue operations