Question 1: For the graph below, consider the start node is T and the goal is node G, Show the sequence of nodes that the algorithms will consider and the f,g,h values for each node using the heuristic of straight-line distance shown in the table below: (show your complete work) A 10 start b. A* search 14 3 S D a. Greedy Best First Search R 10 C G 5 14 12 B State A B C D F P R S T G Heuristic h(n) 20 10 12 13 25 4 10 8 22 0