Question: Slide 36 Please answer A-C Question 1 (30 POINTS): Given the input string WELOVEALGORITHMS, answer the following questions 1.A.) (15 POINTS) Usng the MergeSort algorithm

Slide 36

Please answer A-C
Question 1 (30 POINTS): Given the input string "WELOVEALGORITHMS", answer the following questions 1.A.) (15 POINTS) Usng the MergeSort algorithm provided in the course slides, ilustrate the operation of MergeSort to manually sort this strng Please show each step of your recursive soltion clearly. 1.B.) (10 POINTS) Using the Analysis of Merge Sort algorithm approach we studied in Chl starting with slide 36, perform a ruming time analysis ( only) of executing the MergeSort algorithm Please use your own words im the way you understood the algorithmic analysis. Use a generic " value for the imput size Hint: As the given imput is a string with an arbitrary listing of characters, ie. not necessarily in increasing or decreasing order, you should be considering average rumng IC) (5 POINTS) Usmg the size of the gren imput string , what will be the numeric value of the runming time? Please show your work
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
