The Fibonacci Beanstalk quiz


#1
function growBeanstalk(years) {
  // Base case
  if (years <= 2) {
    return 1;
  }	
  // Recursive case
  return growBeanstalk(years - 1) + growBeanstalk(years - 2);	
}

// Set the height of the beanstalk using your function
var height = growBeanstalk(6)

console.log(height);

https://www.codecademy.com/en/courses/javascript-lesson-205/2/4#
Is there any detailed explanation of what’s happening in the recursive case here …
I’ve been trying to understand this quiz for a while :disappointed_relieved:
Thanks in advance
Let me know if it’s the wrong category, it’s my first question here