Dijkstra's algorithm is not designed to work for graphs with negative edges. Still, for some graphs with negative edges, it can output the correct shortest path - the cut edges being the only negative edges is an example. So, options A and B are false.
Bellman-Ford algorithm will always output the correct shortest path even when the edge weights are negative as long as there is no negative weighted cycle reachable from source.