Illustrate the performance of thequick-sortalgorithm by providing thequick-sorttreeTcorresponding 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 thepivot, alwaysuse thefirstelement of the list passed as input during the respective call to the quick-sortalgorithm (including recursive calls at any level of the recursion).