(b) Consider the following idea for avoiding large recursion depths in QuickSort. Run QuickSort as usual, but when the recursion depth reaches 3 times the ideal depth at a certain sub-problem, solve that sub-problem directly using MergeSort instead of recursively calling QuickSort. The ideal recursion depth is the depth achieved when the partitioning is perfectly balanced. 1. Modify the above QuickSort pseudo-code to implement this idea. You will need to show the initial call to QuickSort. Assume that you have a MergeSort routine ready for you to use; so, you only call it. Don’t rewrite big blocks of code that do not incur any change; just indicate that they remain the same.

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