Assume the 8-puzzle problem where initial and goal states are defined as follows: Initial State Goal State 1 2 3 281 87 4 43 65 7 65 Assume the cost function (g(x)) to be 1 for each move. answer the following two questions: 3- What is the Manhattan distance of the initial state shown above. enter an integer number 4- what is the value of cost function (f(x)=g(x)+h(x)) of the next node to be selected by using A" algorithm. Enter an integer number