$1)$ Use the recursion tree technique to derive the upper bound of the following recurrences: T$($n$)=8$T$($n$/2)+$ n$^2,$ T$(1)=1$