Pan’s divide-and-conquer matrix multiplication algorithm is based on a partitioning scheme that assumes n is a power of 70. The complexity T(n) of Pan’s divide-and-conquer algorithm satisfies the recurrence relation

Show that this implies that T(n) is approximately n^2.795.
 

T(n) = 143,640T(n/70), n = 70', i> 1, init. cond. T(1) = 1.