Consider the below initial and goal state of 8-puzzle problem and answer the following question. Note: The empty tile is allowed to swap the diagonal cells. 1237-82259-2023/0 immediate neighbor not including InitialSC04498-8 9-2024/5/6 7 8 4498-82259-2023/0 1 8 09- global maxima. Justify problem. 3 5 72 4 6 a. Given below two fitness function, which is the most suitable candidate to find the most su09-2021sc04498 i) Fi(n) = Manhatt8-82 with short answer w.r.t to given above p 11) 202 Puzzle 449 Distance of empty tile w.r.t to its position in the goal state F2(n) = No.of. correctly placed tiles w.r.t to goal state - No.of.misplaced tiles 04/09-2 F10-No.of. correctly placed tiles wir.t to w.r.t to goal state Writ to goal 2259-2 to 111) F3(n) = No.of misplaced tiles w.r.t to goal state - Manhattan Distance of empty tile w.r.t to its position in the goal state iv) F4(n) = No.of. correctly placed tiles w.r.t to goal state4/istance of empty of empr$C04 + Manhattan Distance of 104/6 b. Using the results of part a., apply hill climbing algorithm only for first three (first three goal tests). Depict all the steps of the search algorithm clearly. iterations free iterations