Recall that quicksort works by selecting a pivot, partitioning the array into elements less than and greater than the pivot, and then recursively sorting the subarrays.

For the given array [4,1,3,5,2] with last-element pivot (2), identify the first partitioning step and its result.

After the first partitioning, determine the subarrays that need to be recursively sorted and explain why the pivot (2) is now in its correct final position.