Please explain how this is done using index(0) as a pivot point. Detail hand-trace would be appreciated

Quick sort partitions the array into two regions about an array element called the pivot such that all the elements in the first region are less than or equals to the pivot and the elements in the second region are greater than or equal to the pivot. Here is a hand-trace of the algorithm. 1st Partion3 324 65 7 2nd Parttion 123 3 4 6 5 7 3rd Partition23 346 57 5th Partition123 3 4 6 57 6th Partition | 1 2 3 3 4 5 6 7 7th Partion 12 3 3 4 56 7 Figure 2: A quick sort of an array of eight integers