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).

Write a program that has a conversation with the user. the program must ask for both strings and numbers as input. the program must ask for at least 4 different inputs from the user. the program must reuse at least 3 inputs in what it displays on the screen. the program must perform some form of arithmetic operation on the numbers the user inputs. turn in your .py file as well as a screenshot of your program's output. include comments in your code to explain how it works an example program run might look like (have fun with this and be creative): ‘what is your name? ’ “josh” ‘, josh. what is your favorite color? ’ “green” ‘mine too. do you also like ice cream? ’ “no” ‘josh, how old are you? ’ “40” ‘ and how many siblings do you have? ’’ “3” ‘that means you are one of 4 kid(s). is green the favorite color of anyone else in your house? ’