Help me with this question. Thank you

Recurrence

For a recurrence T(n) = 2T(n/2) + n , for n 2, or T(n) = 1 for n=1 where n = 2^m, m >0.

1. Draw its Recursion Tree, specifying

(a)a height of tree,

(b)the number of node at depth i

(c)the size of input at each depth i

(d)the number of leaves, and

(e)a time at each depth i,