Consider the following graph: [10] [15] 15 E 20 [0] A FL [45] 50 15 B...

  

Transcribed Image Text:

Consider the following graph: [10] [15] 15 E 20 [0] A FL [45] 50 15 B 30 20 20 D [15] 50 G [20] 25 40 40 60 80 H C 40 [12] [20] J 17 17 [15] Note that estimated costs are given in brackets next to each node (e.g., A=[15]), while actual costs are given in plain text as the label of each edge (e.g., A->B = 50). There are three starting nodes, namely "A", "B" and "C", and one finish node, namely "F". Apply greedy best-first search in order to move from each starting node ("A", "B" and "C") to the same finish node ("F"), namely find the paths from "A" to "F", from "B" to "F", and from "C" to "F". If multiple alternative nodes are available at any step, your choice should be based on alphabetical order. For each starting point ("A", "B" and "C"), provide: The computed path showing the order in which every node is visited The total cost of the computed path a) b) c) A tree search at each step justifying each expansion Consider the following graph: [10] [15] 15 E 20 [0] A FL [45] 50 15 B 30 20 20 D [15] 50 G [20] 25 40 40 60 80 H C 40 [12] [20] J 17 17 [15] Note that estimated costs are given in brackets next to each node (e.g., A=[15]), while actual costs are given in plain text as the label of each edge (e.g., A->B = 50). There are three starting nodes, namely "A", "B" and "C", and one finish node, namely "F". Apply greedy best-first search in order to move from each starting node ("A", "B" and "C") to the same finish node ("F"), namely find the paths from "A" to "F", from "B" to "F", and from "C" to "F". If multiple alternative nodes are available at any step, your choice should be based on alphabetical order. For each starting point ("A", "B" and "C"), provide: The computed path showing the order in which every node is visited The total cost of the computed path a) b) c) A tree search at each step justifying each expansion