2. [10 points] If we draw a recursion tree for T ( n ) = T ( 6 5 n ) + T ( 6 1 n ) + c n , what is the length of the shortest path from the root node down to a leaf node? What is the length of the longest path from the root node down to a leaf node?.