1A. Apply Selection sort and Insertion sort on the list

59 46 32 80 46 81 12 95 17

You are required to provide tracing details as demonstrated in the worksheets.

B. What is the worst-time number of comparisons for selection (and insertion) sort for sorting 6, 7 elements, respectively? What is the list size is 5000?

C. Show divide and conquer stages for list of 25 elements

D. What is the worst-time number of comparisons for merge sort for 25 elements?

E. Merge the two pre-sorted sublist.

You are required to give the values of pointers p and q after each new element is added in the merged list.

Index	23	24	25	26	27	28	29	30	31	32	33	34	35	36	37
items	[15	19	31	33	35	40	43]	[10	11	13	28	42	51	54	62]