Task 1: Modify main0 to input array and target integer from the user. 2. Sorting Algorithms Sorting algorithms rearrangi the data in some orde (ascending or descending order). static wold selectisnsertcint arpli) int 8 o arr, Sencthy 1) Ont by one move boundary of insertad acens it tarrigy. orrinanida 3) masida =12 ist trene - arrtuna_iandi arr { and 1 de ] o arr[tidi arc[1] - tensi vold insertionsore(int arrt1) 4 int n o arri iengrh, for ( int i=2+i++i)h. Int key a apefild int 3 a i17 + Wove elewents of yecte, .1-11., that are greater than inty. To ine minition andas watie 4 se at arr [1]> ary ) f y=21 arct[9+1)= keyd