（是非題）Consider two algorithms whose running times $T(n)$ satisfy the following recurrences: Algorithm A: $T(n)=4T(n/2)+O(1)$ Algorithm B: $T(n)=2T(n/4)+O(1)$ Then, Algorithm A is asymptotically faster than Algorithm B.