Implement two versions of the successor function for the 8-puzzle :

one that generates all the successors at once by copying andediting the 8-puzzle data structure ,and one that generates one newsuccessor each time it is called and works by modifying the parentstate directly .Write versions of iterative deepening depthfirst search and A* algorithm that use these functions and comparetheir performance. please code this in c or c#..