I want the code on c++ language

Question Use the A* search algorithm for solving the 8-puzzle. The goal state for the 8-puzzle is [o, 1. 2, 3, 4, 5, 6, 7, 81, starting from and a random initial state 1. Use programming (any language) to simulate the A* search algorithm in solving the 8-puzzle. 2. Evaluate the performance (path cost, expanded nodes and running time). The heuristic function f(n) g(n)+ h(n) where, g(n) - Actual distance form n to the start state base on level of search, and h(n) Number of titles out of place