Answer the following questions related to deterministic quicksort with partition choosing the last element as pivot. use figures to illustrate the operation of partition on array [13, 19, 9, 5, 12, 8, 7, 4, 11, 2, 6, 21]. what is the running time of quicksort when all elements of array have the same value? explain your answer. what is the running time of quicksort when elements of array are in decreasing order? explain your answer.

Java the manager of a football stadium wants you to write a program that calculates the total ticket sales after each game

Write a program that keeps asking the user for new values to be added to a list until the user enters 'exit' ('exit' should not be added to the list). these values entered by the user are added to a list we call 'initial_list'. then write a function that takes this initial_list as input and returns another list with 3 copies of every value in the initial_list. finally, inside print out all of the values in the new list. for example: input: enter value to be added to list: a enter value to be added to list: b enter value to be added to list: c enter value to be added to list: exit output: a b c a b c a b c note how 'exit' is not added to the list. also, your program needs to be able to handle any variation of 'exit' such as 'exit', 'exit' etc. and treat them all as 'exit'.

Think of a spreadsheet as a giant calculator spread of paper chart data collector