Please solve with at much detail as possible. Thank you.

3. [40 points) Derive T(n) for the following recursive functions and determine Big-O def check4(n): if n % 4 > 1: return n return check4(n/4) def quickSort(arr, start, end): if start