Reads 10 integer numbers (34, 57, 13, 82, 11, 8, 69, 44, 6, and 26) from a text file and sorts them in an array. Uses merge sort algorithm to store those numbers in an array.

3. Write an algorithm to find the area of a Circle of radius r.
4. Write an algorithm to read two numbers and find their sum.

The k-Quicksort algorithm is based on the following method for pivot selection.It starts by dividing the input array into k subarrays of equal size (except possibly forthe last one) and applies the classical pivot selection method and partition function oneach subarray (pivot is first element). Then the list of k pivots is sorted using Quicksortand the median x of the k pivots is selected to be used as pivot. Then the partitionfunction is applied to place x in its final position as usual. This is repeated (recursively)until the array is sorted.Does k-Quicksort have a better worst-case running time than the classical Quicksortalgorithm?

23. Consider again the array a = {5,7,1,4,1} and the Selection Sort (code 2) algorithm. What is the last value of the variable minPos, before the algorithm exits? (A) 0 (B) 4 (C) 2 (D) 5 (E) 1