Suppose that a divide and conquer algorithm solves a problem of size n by solving 3 sub-problems each of size 1/3 of the original, the divide step takes time 0 (n), the combine step takes time 0 (na). Furthermore the base case, when n 1; T (1) = 0(1) OT(n) 3T (1) + O(n) + 0 (n), n > 1; T (1) O(1) OT(n) = 3T () + O(n) + 0 (na), n > 10; T (n) = 0(1), n 1; T (n) = 0(1), n = 1 = OT(n) = T() + O(n), n > 10; T (n) = 0(1), n