Consider an unsorted array of elements {25, 17, 36, 2, 3, 100, 1, 19, 7}: i) Show how to get the first four sorted numbers when applying Selection sort and Insertion sort. ii) Show how to get the...

Extracted text: Consider an unsorted array of elements {25, 17, 36, 2, 3, 100, 1, 19, 7}: i) Show how to get the first four sorted numbers when applying Selection sort and Insertion sort. ii) Show how to get the first two partitions for the above array when Quicksort is applied. iii) Show the steps to search for 25 in the above sequence using binary search algorithm. iv) Write a C++ program to search for 17 in the above sequence using linear searching algorithm.