Write the following variant of insertion sort. // The function gets an array of length n of ints, // and applies the Insertion Sort algorithm on the array. // The function returns the array of ints of length n // where output [i] contains the number of swaps // made by the algorithm in the i'th iteration of the outer loop int* insertion_sort(int* array, int n); For example: If the input is the array A=[4,3,6,1,2,5], Insertion Sort on A works as follows: - Insert 4: [4,3,6,1,2,5]: 0 swaps - Insert 3: [3,4,6,1,2,5]: 1 swaps - Insert 6: [3,4,6,1,2,5]: 0 swaps - Insert 1: [1,3,4,6,2,5]: 3 swaps - Insert 2: [1,2,3,4,6,5]: 3 swaps - Insert 5: [1,2,3,4,5,6]: 1 swaps After the execution of the function (1) A will become [1,2,3,4,5,6] (2) the function returns [0,1,0,3,3,1].

//convert array of numbers from farenheit to celcius// example:// argument: [23, 32, 41, 50, 59]// return: [-5, 0, 5, 10, 15]// hint: use Array.mapfunction toCelcius(array){ } //write a function that takes an input array and returns an array of booleans (>=75) or fail (<75)// example:// argument: [20, 30, 50, 80, 90, 100]// return: [false, false, false, true, true, true]// hint: use Array.mapfunction passOrFail(array){ }

How can solve this problem using for loop