1. In a graph, if we know that the shortest path from node A to node G is (A → B → E → G), what is the shortest path from node G to node A?
2. Assume the shortest path in a graph from node A to node H is A → B → H. Also assume that the shortest path from node H to node N is H → G → N. What is the shortest path from node A to node N?