A$.$ Give the partitions generated by the algorithm during the first three calls to the partition subroutine by giving the contents of the array after the subarray is partitioned, from $($the first index of the subarray that is to be partitioned, to $($the last index of the subarray that is to be partitioned, and the return value, partition index $($the last index of the left partition$).$ The initial call is quickSort$([25,37,22,31,25,15,171,0,6).$a$.$ Ist call to partition: from$=$to$=$partition index $=15$ points$]$Contents of data after the First Call to partition