Consider the following pair of recurrences: An = 7An-1 + 2Bn2 for n > 2, Bn = 4Bn-1 +5 An-2 for n > 2, and 40 = A1 = 1 and Bo = B1 = 2. For any given n, the most efficient method to compute the exact value of An takes 0 ( ? ) time. a. These two recurrences depend on each other and the problem does not have a solution. O b. n O c. n2 O d. log n e. 25