Analyze the time complexity of the following recursive function that calculates the nth Fibonacci number using memoization. Provide a step-by-step derivation using the Master Theorem where applicable, or by analyzing the recursion tree and state space reduction achieved by caching.