1- Can Dijkstra's algorithm handle negative edges cycles? Why/Why not? If not, is there any alternative algorithms that can compute the shortest path for a graph with negative cycles? 2-Does either Prim's or Kruskal's algorithm work if there are negative edge weights? 3-When you consider the graph algorithms covered in Chapter 9, do you think any of the algorithms can be used to solve a maze? You may briefly talk about your idea. (BTW, these are the basic algorithms for robots to find their way. Think about iRobot. Their real life is a maze! Of course, there are several optimizations (or algorithms) available) 1- Can Dijkstra's algorithm handle negative edges cycles? Why/Why not? If not, is there any alternative algorithms that can compute the shortest path for a graph with negative cycles? 2-Does either Prim's or Kruskal's algorithm work if there are negative edge weights? 3-When you consider the graph algorithms covered in Chapter 9, do you think any of the algorithms can be used to solve a maze? You may briefly talk about your idea. (BTW, these are the basic algorithms for robots to find their way. Think about iRobot. Their real life is a maze! Of course, there are several optimizations (or algorithms) available)