Elementary Sorts for Data Structure and Algorithms

Please take your time when solving the problems I have enough time do not rush it.

CIS 27: Data Structures and Algorithms Assignment 2 Written Assignments i. Elementary sorts a) Sort the sequence I, L, o, v, E, A, L, G, o, R, I, T, H, M, S using the following sort methods. Show the trace after each iteration of the outer loop. the b Also, compare worst, and average case scenarios for these algorithms. a. Insertion sort b. Selection sort c. Bubble sort b) Show in the style how shell sorts the array E, A, S, Y, S, H, E, L, L, S, O, R, T, Q, U, E, S, T, I, O, N c) Give traces, in the style showing how the keys I, L, O, V, E, A, L, G o, R, I, T, H, M, S are sorted for the following sorting mergesort algorithms: a. Top-down mer b. Bottom-up mergesort