Ehat is the space complexities of recursive and dynamic programming approaches of binomial coefficient?

Question

I saw that the space complexity when using dynamic programming approach(Pascal\'s triangle) is O(n^2). What about the space complexity in recursion approach?