3. Consider the following "divide-and-conquer" algorithm: algorithm printer Input: int n begin for i:= 1 to n do for j = 1 to ln i do printline "hello world" if n > 0 then for k 1 to 3 do printer(ln/3]) end Let T(n) denote the number of lines of output generated by a call of printer(n) Hint: you may want to use Stirling's approximation: Inn!nInn-n. (a) Give a recurrence for the value of T(n) of the above divide-and-conquer algorithm (4 marks)