Q2: Selection sort is a simple sorting algorithm. This sotting algorithm is an in-place comparison-based right end. Initially, the sorted part is empty and the unsorted part is the entire list The smallest element is selected from the unsorted array and swapped with the leftmost element, and that element becomes a part of the sorted array. This process continucs moving unserted array boundary by one element to the right. Write a program which sort eight numbers using this technique