YY Ty—O@1 23

Find the fastest way from an arbitrary point on the map included, to another point on the map. (Picture attached)

Your program will ask the user which node (intersection on the map) is the beginning, and which is the end. The solution will print out the sequence of nodes from beginning to end.