Recursive solution

#1

Given a triangle array, return the minimum path sum from top to bottom.

For each step, you may move to an adjacent number on the row below.
Input: triangle = [[2],[3,4],[6,5,7],[4,1,8,3]]
Output: 11
can you help me with the recurive solution(without dp)
of this problem

#2

Starting from the top node, traverse recursively with each node, till the pathsum of that node is calculated. And then store the result in an array. But this will take O(N^2) space to maintain the array.