Table 2: Estimated cost to go from each vertex

Vertex	h
S	3
1	2
2	2
3	2
4	2
5	0
6	2
7	3
G	0

Edge Cost S,1 (5.2) 2) 2 S,2 1.5 2 2.1 (2.4) 2 2.5 3.4 1 4.5 2 4.6 4 3.6 2 (57) 1 8, C 6, C 3 (7.6) 1 (7: c) 6 Table 1: Travel cost of each edge 2 A Consider the graph shown at the top of the page. The tables in this page and next page proide the costs associated with each edge and the estimated cost to go for each vertex (the start vertex is s and the goal vertex is G)- 1. Is h an admissible heurist Motiv ate your answer. 2. Is h a consistent heuristic? Motivate your