With bubble sort, what is the maximum number of comparisons if there are 5 elements in array x?     10     25     2     5

Removes all odd elements from a partially filled array @param values a partially filled array@param size the number of elements in values@return the new size (the expected output is also attached)

Please run this code for n=6 for arrays 1,34,0,6,78,11 and n=5 for array 8,7,6,5,4 #include <stdio.h>void selection_sort(int arr[], int n) {    if (n<=1)    return ;    int max_id=0;    for(int i=0;i<n;i++) {        if(arr[i]>arr[max_id])        max_id=i;            }    int temp=arr[max_id];    arr[max_id]=arr[n-1];    arr[n-1]=temp;    selection_sort(arr,n-1);    return;}

Create a 1D integer array of size 17. Fill each index with a random value ranging from 1 to 359 inclusive. You will then design and implement the Random Sort algorithm using the following methods: Create a method called check_if_sorted (). It should take in a 1D integer array and return a boolean value. It should return TRUE if the array is sorted in nondescending order, and FALSE otherwise. Hint: If you compare elements in the array and a pair is in the wrong order, that would mean the array is not in non-descending order. Create a method called shuffleArray (). It should take in a 1D integer array and return a 1D integer array. Shuffle the array so that the values are in random different indexes, and return altered array. Hint: There are many approaches to solve this problem – making a second array in the shuffleArray () method might be part of the answer. Create a method called PrintArray (). It should take in a 1D integer array and return nothing. Simply print the current values…