Time complexity of a recursive solution for Fibonacci Number without memoization

Each call to F(n) makes 2 additional calls, to F(n - 1) and F(n - 2). Those 2 calls will then generate 4 calls, which will generate 8, etc.