You are given the following six numbers: 183, 280, 281, 370, 376, and 482. You are told to insert these six numbers, in any order, into a vector of integers. This vector will then be sorted in ascending order using a variation of quicksort that always chooses the last element of the vector as the pivot. How many distinct insertion orders of these six integers would cause this variation of quicksort to run in the worst-case in terms of integer comparisons

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? ’