tri = [

[3],

[7, 4],

[2, 4, 6],

[8, 5, 9, 3]

]

function maxPathSum(tri, m, n) {

for (i = m - 1; i >= 0; i--) {

for (j = 0; j <= i; j++) {

tri[i][j] += Math.max(tri[i + 1][j], tri[i + 1][j + 1]);

}

}

return tri[0][0];

}

maxPathSum(A, 3, 3)

I need to find time complexity of maxPathSum and explain with sufficient details time complexity