another interview

Given an M*N matrix calculate the number of paths between (0,0) and (m,n); no going up or left:

Solution: recursive function => double calll

Question 2: what is the order of complexity of your solution?
3: What is closure in javascript?