d View) Wad Algorithms/Finding the Shortest Path/ Dijkstra's Algorithm program, Google Maps uses such an algorithm to find the best routes This lab will explore an algorithm to find the shortest path between two or more locations. When you have completed this lab you will be able to answer the following questions in the Observations and Conclusions section of your final lab report To get the below link to load. Hit the start button and search for configure java. Click the security tab then edit site list. Click Add and then click into the box and paste the link below using Ctri+v Hit continue then ok to close all of the windows. OPEN THE BELOW LINK IN INTERNET EXPLORER!!! .What is an algorithm? . What is a graph (in Computer Science context)? . What does Dijkstra's Algorithm do? 1) Explore a shortest path applet that implements Dijkstra's Algorithm at http/www.dap toronto edu/people/JamesStewart /270/9798s Laffra/DikstraApplet htm Are there some computational tasks that are beyond even a super computer's capability? Choose the button labeled "Example on the right hand side a) Write down 4 possible routes from (a) to (t). For The shortest path problem is the problem of finding the best route between two points. An example is finding the fastest way to get from one city to another on a road map: in this case, the points represent locations and the edges connecting them represent segments of road and are labeled by the distance of that road segment. The popular online example: (a, b. c. f) b) For each path, write down the length of the route c) Without running the algorithm, see whether you can determine the shortest path from the starting node (a) to the node (i). d View) Wad Algorithms/Finding the Shortest Path/ Dijkstra's Algorithm program, Google Maps uses such an algorithm to find the best routes This lab will explore an algorithm to find the shortest path between two or more locations. When you have completed this lab you will be able to answer the following questions in the Observations and Conclusions section of your final lab report To get the below link to load. Hit the start button and search for configure java. Click the security tab then edit site list. Click Add and then click into the box and paste the link below using Ctri+v Hit continue then ok to close all of the windows. OPEN THE BELOW LINK IN INTERNET EXPLORER!!! .What is an algorithm? . What is a graph (in Computer Science context)? . What does Dijkstra's Algorithm do? 1) Explore a shortest path applet that implements Dijkstra's Algorithm at http/www.dap toronto edu/people/JamesStewart /270/9798s Laffra/DikstraApplet htm Are there some computational tasks that are beyond even a super computer's capability? Choose the button labeled "Example on the right hand side a) Write down 4 possible routes from (a) to (t). For The shortest path problem is the problem of finding the best route between two points. An example is finding the fastest way to get from one city to another on a road map: in this case, the points represent locations and the edges connecting them represent segments of road and are labeled by the distance of that road segment. The popular online example: (a, b. c. f) b) For each path, write down the length of the route c) Without running the algorithm, see whether you can determine the shortest path from the starting node (a) to the node (i)