a$)[$CO$2]$ "Dijkstra's Algorithm can find the single source shortest paths for any graph." c$)[$CO$1]$ Continuing on the previous question, suppose the travel time of each bridge is not equal

anymore. The updated travel times are as follows:

Now, the explorer wants to find a set of bridges that connects all the islands with the minimum

total travel time. However, the bridge between Ember and Flare and the bridge between Flare and

Glimmer suddenly become vulnerable and may break down anytime. So$,$ the explorer decides to

avoid these two bridges while constructing the subgraph that connects all islands.

Answer the following questions based on this scenario.

i$)$ Which bridges will the explorer choose?

ii$)$ What will be the total travel time?

Show your works on the answer scrint.

Do you think this statement is true? If yes, state your reasoning. Else, validate it to be false with

an example graph.

b$)[$CO$1]$ Imagine a daring explorer on a mission to uncover hidden treasures scattered across a

cluster of islands. The listed islands have a bidirectional bridge between them:

If each bridge has a travel time of $5$ minutes, give an $O(V+E)$ algorithm that can find the shortest

travel time from Aqua to every other island.

Explain your idea in an executable code$/$pseudocode$/$flow$-$chart format.

please answer should be handwritten