Give a recursive equation(of the form T(n)=...) for the running time of each of the following algorithm and use cases, along with the asymptotic solution to that recurrence (in O or theta notation, whichever is most precise for that case):

1. The worst-case for insertion sort

2. the best case for insertion sort

3. the worst case for quicksort

4. the best case for quicksort