Implement in-place recursive Quick-Sort using an array list to represent the sequence to be sorted and used for the intermediate steps of the algorithm. Use a random element as the pivot. All elements of the sequence should come from a Comparable class. Your method should also return the maximum depth of all of the recursive calls.