2. Analyzing and Designing Algorithms Insertion sort, Merge Sort, Divide and Conquer Best Running Time, Worst Ruining Time of Insertion Sort. Recurrence function of the running time Merge Sort. Sample questions: - Illustrate the operation of Insertion-sort on a given rray =[31,41,59,26,41,58] - Rewrite the INSEIRIION-SOIT' procedure to sort into nonincreasing instead of nondecreasing order - Express the function n3/1000100n2100n+3 in terms of -notation 1 - Illustrate the operation of merge sort on the array =[3,41,52,26,38,57,9,49]