llustrate the performance of the quick-sort algorithm by providing the quick-sort tree T corresponding to (1) the input sequence processed and (2) the output sequencegenerated based on the following input sequence: (6,2,9,1,8,5,7,3). For the pivot, always use the first element of the list passed as input during the respective call to the quick-sort algorithm (including recursive calls at any level of the recursion).