C++

We are interested in finding the 3^rd largest element in the array [5, 1, 2, 0, 8, 9, 7]. Using Quick Select algorithm. Lomutos partition algorithm uses the first element i.e., 5, as the pivot and returns the position of the pivot. What is the next action that will be taken by the Quick Select algorithm and why? No need to trace the algorithm. This is just a one- or two-line answer.