$2.$If we draw a tree of recursive calls $($similar to those in my example$)$ for

$T(n)=T(\frac{5}{6}n)+T(\frac{1}{6}n)+cn,$ 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?

similar to a binary tree

n

$/\backslash$

n$-1$ n$-1$

$/\backslash$

n$-2$ n$-2$