Recursionmedium
0:00.0

How many total function calls (including the initial call) are made when computing T(n)=2T(n1)T(n) = 2T(n-1) with base case T(0)=1T(0) = 1, starting from T(4)T(4)?