I need to find the average running time for quick sort, assuming easch partition case is the same. I also need to find the guess function f$($n$)$and prove that

T$($n$)=$big O$($f$($N$))$ using inductive proof.