5. [4 pts.] Consider a deterministic version of quick-sort in which the pivot p is always set to the median of the input sequence S. The median of a sequence S can be computed in linear time using deterministic quick-select. (a) Provide a recurrence relation/equation for the worst-case running time T(n) of this version of quick-sort as a function of the size n of S. (b) Provide a tight big-Oh characterization of T(n).