Dijkestra s single source shortest path algorithm works if all edges weights are negative and there are no negative cost cycles? (A) True (B) False (C) NA (D) NAâ–ºCorrect Option Correct Option is: A