There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2 stairs at a time. Count the number of ways, the person can reach the top. Count ways to reach the nth stais..apply recursion to write this code..please use C programming language to solve this code..as soon as possible