(dijkistra's algorithm): given a network with n stations. assuming the shortest between s,t was found using dijkstra's algorithm. let that path be denoted as (a_1,a₂,_....,a_k)

1)will the algorithm will necessarily find the shortest path between each pair of nodes (a_i,a_j) (i

2)assume that between the nodes s and t, there's an at least additional path with the same weight, but with different edges(meaning both paths have different edges, nothing in common). suggest a way to find that path and explain well