True/False: By the master theorem, the solution to the recurrence T(n) 3T(n /3 ) + log n is T(n) n), assuming the following definition of the maste...

True/False: By the master theorem, the solution to the recurrence T(n) 3T(n /3 ) + log n is T(n) n), assuming the following definition of the master theorem. 0(n log A recurrence relation of the following form T(n)=cn< c aT(n/b) e(n'), n Has as its solution T(n) e(na) 1) If a> b so this is the number of leaves in the recursion tree) then (Work is increasing as we go down the tree, T(n) e(n'log, n) 2) If a bthen so the work is the height,log, n, times work/level). (Work is the same at each level of the tree, 3) If a< b dominated by the initisl work at the root) T(n)e(n) then (Work is going down as we go down the tree, s odominated by the initial wok at the root