Recursion depth ( or maybe call stack size ) of quick sort algorithm

I am finding the recursion depth or the level of the best case for the quick sort algorithm.