Please solve this problem with steps

Quicksort Assume we use the HOARE-PARTITION procedure below (also given in class) partition(a,n)/variant due to Hoare// // partitions a[1..n] around a[1] = pvot // // output j; A-] and A2- alj +1.n] // 1- zc-a[1] 3- js-n+1 4. repeat j#x a j] and go to 4 else output j and halt //indices have crossed each other// A 1-1..j] and A 2-alj+1..n] // (a) Demonst rate the operation HOARE-PARTITION on the array 13, 19,9,5, 12,8, 7,4, 11,2,6,21], showing the values of the array and auxiliary values after each iteration of lines 4-6