Find the sequence to solve the puzzle below by Greedy algorithm using the heuristic function of Tiles out of place

Initial state:

Goal state:

$\backslash$table$[[1,2,3],[7,4,5],[8,6,-]]$

$\backslash$table$[[1,2,3],[4,5,6],[7,8,-]]$

In your answer, show the calculated $h(N)$ value in each status $N$ of your given answer respectivelly. When you reach the goal put in the rest of answers the same values of the goal