2 Informed Search Node h(n) 70100 80 T100 60 Figure 2: Informed Search. Question 8 (15 pts): (1) Repeat the problem right above with A* search. (2) In addition, show the f(n) value for all nodes expanded (you need this to sort them in the node list). (3)Which one gives a lower cost solution: Greedy best-first or A*? Note: Note that the same node can appear in the node list with a different f(n) value, depending on the path taken. For example, f(e) will be different if you followed a different path to reach the node: a + b + e vs. a + b + e. Due to this, you may need to track which path you followed to reach node n and calculate the f(n) value accordingly. It helps to write the node f as ac f to indicate the path in the subscript (a +0+ f). Also, for sorting, it helps to indicate the f value as a subscript. For example, ac f. Note: When sorting the node list by hand, some tied values may appear. In this case, put the oldest node ahead of new nodes. 2 Informed Search Node h(n) 70100 80 T100 60 Figure 2: Informed Search. Question 8 (15 pts): (1) Repeat the problem right above with A* search. (2) In addition, show the f(n) value for all nodes expanded (you need this to sort them in the node list). (3)Which one gives a lower cost solution: Greedy best-first or A*? Note: Note that the same node can appear in the node list with a different f(n) value, depending on the path taken. For example, f(e) will be different if you followed a different path to reach the node: a + b + e vs. a + b + e. Due to this, you may need to track which path you followed to reach node n and calculate the f(n) value accordingly. It helps to write the node f as ac f to indicate the path in the subscript (a +0+ f). Also, for sorting, it helps to indicate the f value as a subscript. For example, ac f. Note: When sorting the node list by hand, some tied values may appear. In this case, put the oldest node ahead of new nodes