both are incorrect
A)Even a graph contain negative edge weight cycle, dijkstra's algorithm will always terminate although shortest path may or may not be correct.
B)Bellman ford algorithm for weighted graph will always give correct result if there exist a path between them