The 15-puzzle consists of 15 numbered tiles on a square frame with a capacity of 16 tiles. We are given an initial arrangement of the tiles, and the objective is to transform this arrangement into the goal arrangement of through a series of legal moves. The only legal moves are ones in which a tile adjacent to the empty spot (ES) is moved to ES. Solve the problem of transformation from initial to goal arrangement (shown in below figure) using LC branch and bound with state space tree. (10M) Initial arrangement Goal arrangement 1 2 3 4 1 2 3 4 5 8 5 6 7 6 8 9 10 7 11 9 11 12 10 14 13 15 12 14 15 13