24. Assuming in each case that T (n) is eventually nondecreasing, use Theorem B.5 to determine the order of the following recurrence equations (a) T(n) = 2T()-6n3 for n > 1, n a power of 5 (b) T(n)-40T2n3for n1, n a power of 3 (c) nT (n) = 167, G) +7n4 for n > 1, n a power of 2 T(1) = 6 T (1) 5 T (1) = 1 25. Assuming in each case that T (n) is eventually nondecreasing, use Theorem B.6 to determine the order of the following recurrence equations (a) T(n) = 14ng)+6n for n > 25, n a power of 5 T (25) = 60 (b) T (n) = 41, ( ) +2n2 for n > 16, n a power of 4 T (16) 50