P1. Use the tree and table method to compute the time complexity for T(N)-ST( N / 4 ) + 2N. Assume TIO)-1 and T(1) 1. Fill in the table below and finish the computations outside of it: Level Argument/ Cost of one Nodes perCost of whole level Problem size node level 2 k= Leaf level. Write k as a function of N Total tree cost calculation: T(N)- Draw the tree. Show levels 0,1,2 and the leaves level. Show the problem size I[... 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 P1. Use the tree and table method to compute the time complexity for T(N)-ST( N / 4 ) + 2N. Assume TIO)-1 and T(1) 1. Fill in the table below and finish the computations outside of it: Level Argument/ Cost of one Nodes perCost of whole level Problem size node level 2 k= Leaf level. Write k as a function of N Total tree cost calculation: T(N)- Draw the tree. Show levels 0,1,2 and the leaves level. Show the problem size I[... 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