Hello chegg expert please I need the correct and complete answers of those questions they are very important for me and in the same time it's urgent very very urgent please please help me I need your help.

Question 3-1. Suppose there are n steps in a stair. Each time you can only take one or two steps. The relationship between n and the number of ways to go upstairs is shown in the following table Calculate how many ways to go upstairs by using by writing: (1) a recursion program: int JUMP_R(int n); (2) a dynamic programming program: int JUMP_DP (int n ). Question 3-2. Implement the following program to solve the Hanoi tower problem by moving the plates from pillar a to pillar b with the help of pillar c. Draw the moving process for n=3. yoid Hanoi( int n, int a, int b, int c ) \{ if (n=1) else \{ Hanoi(n-1, a, c, b); Move(n,a,b); \}