P2. bse the tree and table method to compute the time complexity for T(N) = 47(N-5) + 7Assume|N)-1 for all 0SNS4. Assume N is a convenient value for your computations. Fill in the table below and finish the computations outside of it: Level Argument/ Cost of one Nodes per Cost of whole level Problem node size level 2 Leaf level. Write k as a Lfunction of N. Total tree cost calculation:. T(N)- ) Draw the tree. Show levels 0,1,2 and the leaves level. Show the problem size .) as a label next to the node and inside the node show the local cost (cost of one node) as done in class. For the leaf level and level 2 it suffices to show a few nodes