Question 7 Poleg is often med for solving planning problem. Cender the following pilieting problem, also semed to as the slopen You terve tiles arranged in the following pain In this example, the table given be represents a persibile e state of the problems, where the pa seperents an empty location. We can represent this as followe 1,4,3,6,7,531. The procedure should range the time until the following gral state is reached 7 Tiles can anly be mowed by shilingabile adjacent to the emply location into the empty location, i.e. by wapping their position Write Prolog cende do make pravice for all valid moves a plantet can we to reach the qual, amely goal([1,2,3,0,2,4,7,6,5). (Do not try to solve the problem by trying different move. You stasaldjust provide a list of all the valid maves. Prolog will do the work if we implement the publicmungadeph-fied or leadi- first search ihm) Question 7 Poleg is often med for solving planning problem. Cender the following pilieting problem, also semed to as the slopen You terve tiles arranged in the following pain In this example, the table given be represents a persibile e state of the problems, where the pa seperents an empty location. We can represent this as followe 1,4,3,6,7,531. The procedure should range the time until the following gral state is reached 7 Tiles can anly be mowed by shilingabile adjacent to the emply location into the empty location, i.e. by wapping their position Write Prolog cende do make pravice for all valid moves a plantet can we to reach the qual, amely goal([1,2,3,0,2,4,7,6,5). (Do not try to solve the problem by trying different move. You stasaldjust provide a list of all the valid maves. Prolog will do the work if we implement the publicmungadeph-fied or leadi- first search ihm)