Need help with any language . Thank you for helping.

Write a program that solves 15-puzzle problems using heuristic functions and a best-first or A* search. You can also add pruning, backward, bidirectional, or staged search modifications. (But no problem decomposition strategies!) Use whatever language/machine you want. Input: Initial state only (Goal state is fixed at 12 3 4) 9 10 11 12 13 14 15 [] Output: 1. Number of nodes generated (open closed sets) 2. Length of solution path 3. Solution path from IS to GS using Right, Left, Up, and Down operators (= how you move the "blank") with resulting board configurations. Hand in: 1. Documented program 2. A detailed, specific description of heuristic function (s) used 3. A description of any search modifications used 4. 3 execution runs on the following data: Data: 1. [1 6 2 4 1 10 3 7 5 9 14 8 13 15 11 12 der 2. 9 13 2 11 12 14 10 15 [1 3. [ 12 9 13 15 11 10 14 Due: Tuesday, Feb. 26, 2019 Hand in Doun t inclue th G S a eveule Write a program that solves 15-puzzle problems using heuristic functions and a best-first or A* search. You can also add pruning, backward, bidirectional, or staged search modifications. (But no problem decomposition strategies!) Use whatever language/machine you want. Input: Initial state only (Goal state is fixed at 12 3 4) 9 10 11 12 13 14 15 [] Output: 1. Number of nodes generated (open closed sets) 2. Length of solution path 3. Solution path from IS to GS using Right, Left, Up, and Down operators (= how you move the "blank") with resulting board configurations. Hand in: 1. Documented program 2. A detailed, specific description of heuristic function (s) used 3. A description of any search modifications used 4. 3 execution runs on the following data: Data: 1. [1 6 2 4 1 10 3 7 5 9 14 8 13 15 11 12 der 2. 9 13 2 11 12 14 10 15 [1 3. [ 12 9 13 15 11 10 14 Due: Tuesday, Feb. 26, 2019 Hand in Doun t inclue th G S a eveule