especially b section, ni code just explanation

3. Consider a pole-graph which is an undirected graph with positive edge weights, consisting of two poles connected through a layer of nodes as follows: a) (10p) How long would it take Dijkstra's algorithm to find the single-source-shortest-paths from one of the poles in a pole-graph to all other nodes (as a function of n where n is the number of vertices in a pole-graph)? b) (25p) Describe and analyze a more efficient algorithm for solving the single-source-shortestpaths problem on a pole-graph. To get full credit, you need to argue the running time