Given the following graph G1 in Figure 1:

Give the depth-first traversal of the graph, starting from vertex G. ( in case you have the choice between multiple vertices to visit, always select the vertex that has smaller lexicographic order first, i.e. alphabetical order) Give the breadth-first traversal of the graph, starting from vertex G. ( in case you have the choice between multiple vertices to visit, always select the vertex that has smaller lexicographic order first, i.e. alphabetical order) Draw a spanning tree that can be found in the graph. Find the shortest path between node G and all other nodes in the graph, using Dijkstra's algorithm. List the path and cost of the path

Use the same approach from the following website ( https://www.raywenderlich.com/4 9 46/introduction-to-a-pathfinding) and as illustrated in the class to show how the cat Moody can use the A* algorithm to get to the bone. Use the same approach to show the results of each step, including the open and closed list. Use also the same movement cost and heuristic computation approach.

Figure 1. Graph G1