<prompt> Create an algorithm to determine the shortest route from point A to point B.Point A - 1,1, Point B - 6,7  <response>: One simple algorithm to find the shortest route from point A to point B is to use the Euclidean distance between the two points. This can be calculated as the square root of the sum of the squared differences between the x and y coordinates of the two points. Heres how the algorithm would work for the given input:1. Start with the coordinates for point A 1,1 and point B 6,72. Calculate the difference in the x-coordinates: 6-1 53. Square the difference: 52 254. Calculate the difference in the y-coordinates: 7-1 65. Square the difference: 62 366. Add the squared differences: 25 36 617. Take the square root of the result: 61 7.818. The shortest distance from point A to point B is 7.81 units.Note that this algorithm provides the shortest distance between the two points but does not account for any obstacles or other considerations in the path from point A to point B. 