1) Provide a uniform-cost search (UCS) on the graph below. You may find it helpful to execute the search on a piece of paper and then insert the scanned image into your logbook. Start m 3 6 5 A N B 2) Consider the following graph. The numbers written on edges represent the distance between the nodes, whereas the numbers written on nodes represent the heuristic values. Using A* algorithm, find the most cost-effective path to reach from start state A to final state J. 10 5 3 co 5 1 5 3 10 5 3 10 3 1 2 Goal 7 3