use mathematical induction to show that when n is an exact power of 2, the solu- tion of the recurrence t .n/ d ( 2 if n d 2 ; 2t .n=2/ c n if n d 2k , for k > 1 is t .n/ d n lg n