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