$2.$If we draw a tree of recursive calls $($similar to those in Figure $2\mathrm{.}5$ and Figure $2\mathrm{.}6$ of the textbook$)$ for T$($n$)=$T$(5/6$ n$)+$T$(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?