Exercise 1 Sort the items in the following array using the merge sort algorithm: [8,45,10,23,14,65,98,2] Exercise 2. Using the recursive max-min algorithm complete recursive calls tree for the following array Homewock 1 Using Quick Sort Algorithm, illustrate how to perform the first partitioning operation to sort the following array in a non-deereasing order. A={14,78,32,65,41,44,36,10,13,17} Exercise 4 Using Fractional Knapsack, find an optimal solution to the knapsack instance. Where number of items n=6, knapsack capacity m=42, (p1,p2,p3,p4,p5,p6)=(12,10,36,14,26,8) and (w1,w2,w3,w4,w5,w7)=(10,6,15,9,15,5)