Can someone explain this to me and how to solve it in details, I posted it before weeks but got nothing back and so I'm posting it again, please show me the work for this, this is related to artificial intellengence book

4. Given the road map and the air distances (beeline) between the cities, we want to go from the city A to Husing the path with minimum cost Solve the problem using a) Breadth First Search and b) A Search algorithms Show all the steps of alaouthm on the search tree - Draw the search tree, Write the cost at each node, - Write a number at each node showing its expansion order (i.e. root's number will be 1 - Write solution path SHOW THE EXECUTION OF THE ALGORITHMS STEP BY STEP, Assume that the algorithms keep an explored set to handle repeated states. Use the following labeling method to show the expansion order and cost at each node. www For Example: Expansio Order Cost Cost(A) = 78 Node Name A . BEELINE DISTANCES BETWEEN CITIES A F 57 0 45 76 G 64 54 30 0 HO B 30 16 0 33 19 34 0