The diagram underneath represents a graph where the task is to reach the goal state K from the start state A by following the lowest-cost path between the two states. For each state in the diagram, a heuristic estimate of the distance from that state to K is indicated above the state in italics. For each arc connecting two states, the actual cost of traversing the arc forms a label for the arc. Show how an A algorithm (would go about finding the shortest path between A and K. (12 marks)