d. b rarr c rarr d destion 9 Let D= a b c d a 0 0 -2 1 b 5 0 3 6 c 7 2 0 3 d 4 -1 2 0 be the all pairs shortest path of a graph G, and S= a b c d a a d c c b a b a c c d d c d d b b b d The shortest path from vertex " b " to vertex " d " is Answers: a. b- > d b. b rarr a rarr c rarr d c. b rarr a rarr d d. b rarr c rarr d estion 10