Open your Python programming environment and create a new file named hanoi.py.2. Define a recursive function tower_of_hanoi(n, source, auxiliary, target) that takes fourarguments:- n: the number of disks to be moved from the source tower to the target tower.- source: a string representing the source tower, e.g. "A".- auxiliary: a string representing the auxiliary tower, e.g. "B".- target: a string representing the target tower, e.g. "C".-3. Implement the function by following these steps:- If n is equal to 1, move the top disk from the source tower to the target tower.- Otherwise, recursively move n-1 disks from the source tower to the auxiliary tower.- Move the top disk from the source tower to the target tower.- Recursively move the n-1 disks from the auxiliary tower to the target tower.4. Test the function by calling it with different numbers of disks and tower positions.5. Once the function is working correctly, add print statements to display the sequence of movesrequired to solve the problem for a given number of disks.6. Write a brief reflection on the problem-solving process and the use of recursion to solve theTower of Hanoi problem