***Need help finding the space complexity for solution 1

Solution 1: Pure recursive - asymptotic time complexity can be very large (exponential with n) as we will see later in the course. Enter the following code: int climbStairs ( int n){ if (n==1) return 1; if (n==2) return 2; return climbStairs (n1)+ climbStairs (n2) \} Fill in the following table with your RunTimes. Also fill in the space complexity for Solution 1 . Note that Solution 1 is recursive and the space complexity is basically the usage on the user-stack. So you need to determine how deep the recursion can go