for question B only

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)=14T(5n)+6n for n>25,n a power of 5 T(25)=60 (b) T(n)=4T(4n)+2n2 for n>16,n a power of 4 T(16)=50 Suppose that a complexity function T(n) is eventually nondecreasing and satisfies T(n)=aT(bn)+cnkforn>2,napowerofbT(s)=d where s is a constant that is a power of b,b2 and k0 are constant integers, and a,c, and d are constants such that a>0,c>0, and d0. Then the results in Theorem B.5 still hold