write the open and closed list until you reach the target

Based on the skeleton problem, complete a program containing the uniform cost search, the best-first search, and the A* algorithm. Here, we suppose that A is the initial node, and E is the target. The cost of each edge and the heuristic value of each node are also given in the figure. 8 (14) (10) (15) 4 2