$.$ The $8-$puzzle problem presents a start state and a goal state as outlined below.

a$)$ Write a computer program to solve the problem using the A$*$ search method.

b$)$ Run your code $10$ times generating random starting conditions and record the average number

of steps taken to reach the goal.

c$)$ Describe the heuristics used in your implementation. Are there other possible heuristics?