AI pls answer fast Pls explain all steps as well

UNIT- Q2. Consider a network of cities represented as undirected graph. (a,c,4); (b.c,2); (a,b,3); (d, e,5); (a,d,3) and (c,e,3). Goal is to go from city'a' to 'e': Perform following algorithm (a) Greedy Best First Search (b) A* Search UNIT- Q2. Consider a network of cities represented as undirected graph. (a,c,4); (b.c,2); (a,b,3); (d, e,5); (a,d,3) and (c,e,3). Goal is to go from city'a' to 'e': Perform following algorithm (a) Greedy Best First Search (b) A* Search