On Page 654, implement the Dijkstras algorithm in Code Fragment 14.12 and run your code on the Example in Figure 14.15. Your program should print out all the pictures in Figure 14.15, 14.16 and 14.17, from (a) to (j). Please code in JAVA

Figure 14.15: An example execution of Dijkstra's shortest-path algorithm on a weighted graph. The start vertex is BWI. A box next to each vertex v stores the label D[v]. The edges of the shortest-path tree are drawn as thick arrows, and for each vertex u outside the "cloud" we show the current best edge for pulling in u with a thick line. (Continues in Figure 14.16.) 14.6. Shortest Paths 655 (c) (d) (e) (t) () Figure 14.16: An example execution of Dijkstra's shortest-path algorithm on a weighted graph. (Continued from Figure 14.15; continues in Figure 14.17.) Chapter 14. Graph Algorithms (i) (j) Figure 14.17: An example execution of Dijkstra's shortest-path algorithm on a weighted graph. (Continued from Figure 14.16.)