Frank is debugging a recursive function that computes Fibonacci numbers. The function runs with time complexity T(n) = 2T(n−1) + 1, with T(1) = 1. What is the value of T(10)?