Can someone explain how to draw a call tree for the below program (in C++)? It should look similar to the picture below it.

E#include #include "stdafx.h" #include using namespace std; string NAME = "Nash". // replace it with your name // taking an input parameter n int par(int n) // base case for n = 1 if (n == 1) return 3; // base case for n if (n = 2) 2 return 4 // if neither of above, then will cal1 it recursively with n-1 and n-2 return par(n 1) par(n - 2); int main) // output cout