Q.solve a using breadth first search (AI) (please answer fasttttt)

have to write your answer in the Text-Field given below (a) Using the 'city-map problem below, define appropriate heuristics, find path cost and search cost assuming a is source and g is goal. Use best first search City Map Problem: Each city is represented by letters {a,b,c,d,e,fg) and the cost to travel from city c1 to city c2 is specified in 3-tuple (C1,c2,cost) as (a,b,5); (a,c,3); (b,d,4); (c,b,2); (0,1,2); (d,e,1): (e.g.2); (f.e,3); (b) in the context of in have to write your answer in the Text-Field given below (a) Using the 'city-map problem below, define appropriate heuristics, find path cost and search cost assuming a is source and g is goal. Use best first search City Map Problem: Each city is represented by letters {a,b,c,d,e,fg) and the cost to travel from city c1 to city c2 is specified in 3-tuple (C1,c2,cost) as (a,b,5); (a,c,3); (b,d,4); (c,b,2); (0,1,2); (d,e,1): (e.g.2); (f.e,3); (b) in the context of in