All my question is from C++ Given the following array:4 15 8 3 28 7Write the order of the values in the array after the second swap of the selection sortin ascending order. Use a space as a delimiter. Given the following array:4 15 8 3 28 7Write the order of the values in the array when the bubble sort has placed thelargest value in the last index. Use a space as a delimiter.

Note: This is a multiple-question-based problem. As per company guidelines, only the first question is solved. Kindly send the remaining questions on the portal for their answer. SELECTION SORT: The selection sort algorithm sorts an array by continually choosing the smallest member from the unsorted segment and placing it at the beginning (in ascending order). In a given array, the algorithm keeps two subarrays: This is the subarray that has previously been sorted. The unsorted subarray is the last one. In each iteration of selection sort, the unsorted subarray's minimal element (in ascending order) is chosen and transferred to the sorted subarray. The advantage of selection sort is that it never does more than O(n) swaps, which makes it handy when memory writes are expensive.IMPLEMENTATION: Given the contents of the array are: 4 15 8 3 28 7 The minimum element in the given unsorted array is 3 and hence for the first iteration, element 3 is going to be swapped with the element at the first index. 3 15 8 4 28 7 Now, the minimum element in the unsorted array is 4, and hence for the second iteration, element 4 is going to be swapped with the element that is present at the second index. 3 4 8 15 28 7 Hence, the contents of the array after two swaps are 3 4 8 15 28 7.