please solve this queston with 2 part with C-Programing language.

C) 6 D) 7 5. Program design (20, 8+12) (1) There is a 4-digit number ABCD. It is 9 times of DCBA, which means ABCD=9*DCBA. Output all the possible numbers. (2) Input 2 integers m and n. Output the Fibonacci sequence from the mth term to nth term, a total of (n-m+1) items. The Fibonacci sequence is: 1 12 35 8 13 21..... You must define the recursive function fib(n) to return the number of Fibonacci sequence of the nth term. For example, fib(7) returns the value of 13. In the main function, input 2 positive integers m and n. Call the function to output