1 votes 1 votes Algorithms algorithms + – KISHALAY DAS asked Dec 21, 2016 KISHALAY DAS 288 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply akashsheoran commented Dec 21, 2016 reply Follow Share Is it 9? 1 votes 1 votes KISHALAY DAS commented Dec 21, 2016 reply Follow Share How?..ans given btw 11 0 votes 0 votes akashsheoran commented Dec 21, 2016 reply Follow Share It's nothing... whenever a function is evaluated...it will be stored in the stack. So just make the recursion tree. We will have to store all from T(2) to T(10). Since T(0) and T(1) are already evaluated...I don't think we need to store them. 0 votes 0 votes Please log in or register to add a comment.