write a Dijkstra's Algorithm (with complete step and details so i can understand it) for a robot which moves from point A to point B and over come the obstacles in between. starting point (A) x=0 y=0 target (B) x=10 y=10 obstacle 1 x=2 y=2 obstacle 2 x=8.5 y=8.7