Please perform below $4$ steps to solve the task:

Read the problem statement.

Formulate the algorithm using pseudocode and top$-$down, stepwise refinement.

Write a $C$ program.

Test, debug and execute the $C$ program

Task: Every budding computer scientist must grapple with certain classic problems, and the Towers of Hanoi $($shown in the following diagram$)$ is one of the most famous of these:

priests complete their task, so there's little incentive for us to facilitate their efforts.

terms of moving only $n-1$ disks $($and hence the recursion$)$ as follows:

a$)$ Move $n-1$ disks from peg $1$ to peg $2,$ using peg $3$ as a temporary holding area.

b$)$ Move the last disk $($the largest$)$ from peg $1$ to peg $3.$

c$)$ Move the $n-1$ disks from peg $2$ to peg $3,$ using peg $1$ as a temporary holding area.

The process ends when the last task involves moving $n=1$ disk, i$.$e$.,$ the base case. This is accomplished by trivially moving the disk without the need for a temporary holding area.

Write a program to solve the Towers of Hanoi problem. Use a recursive function with four parameters:

a$)$ The number of disks to be moved.

b$)$ The peg on which these disks are initially threaded.

c$)$ The peg to which this stack of disks is to be moved.

d$)$ The peg to be used as a temporary holding area.

$13($This means move one disk from peg $1$ to peg $3.)$

$12$

$32$

$13$

$21$

$23$

$13$

Need help, in C