Given a one$-$dimensional array of integers, write an Excel user$-$defined function that will accept the parameter of a one$-$dimensional array of integers and return a one$-$dimensional array of the same integers in order from least to greatest using the Insertion Algorithm.

The main procedural trick will be$,$ as we compare our next element from the unordered array with, from right to left, the elements of the newly ordered array and find our next element is less than the one being compared, we must shift the position of the compared element to the right one position in the array. That is$,$ suppose the ordered array has elements $($a$\_1,$ a$\_2,$ a$\_3,...,$ a$\_$h$-2,$ a$\_$h$-1,$ a$\_$h$)$ and we have found that our next element from the unordered array, X$,$ is less than a$\_$h$.$ We must change the position of a$\_$h from a$\_$h to a$\_$h $+1$ before moving along to compare X with a$\_$h$-1.$ If we then find X$,$ greater than or equal to a$\_$h$-1,$ then we can give X position a$\_$h in the ordered array.