The graphic in the picture representing the road planning to be made has been prepared. paths (edges) are non-directional and the numbers to be overwritten determine the distance between the connected nodes (vertice). By accepting corner 3 as starting point, it is requested to determine the shortest path to corner number 7. a) Calculate the shortest path from the starting point to all other vertices. b) Determine the shortest path to corner 7. c) explain the algorithm of the computational process we applied with pseudo code and flowchart. (this question is about robotic programming)