Depth first search is shortest path algorithm that works on un-weighted graphs? (A) True (B) False (C) NA (D) NAâ–ºCorrect Option Correct Option is: B