Given sets A$,$ B and C$.$ Show that A $($B $$ C$)=($A $$ B$)($A $$ C$).$

Use a recursion tree to determine a good asymptotic upper bound on the recurrence T$($n$)=4$T$($n$/2+2)+$n$.$Use the substitution method to verify your answer.