Solve in python

You need to arrange three boxes labeled as A$,$ B and C$.$ State spacegraph of

the problem is shown below.

Apply A$*$ search to reach the goal. Calculate total

cost for goal.

$h(n)="$# of blocks misplaced $($if the upper block is not at its goalposition"

$g(n)="$# of steps so far"