Task 1: Modify main0 to input array and target integer from the user. 2. Sorting Algorithms Sorting algorithms rearrang the data in some ordes (ascending or descending order). statit wold selectionsertilint arrili) ist n o wrs lengthy int tene = arrinas_its li arr [1] = tewi , vadd insertionsortidint acel]lis int in o arr, Jengthy fo hove eleants of acrep. [11], that are of thelr current pealtian. Task 2: Write a complete.Java program to implement above sorting algorithms. Input an int array from user, and choice of sorting algorithm to be used. Display the sorted array to user. ( Note: Quick sort and Merge sort are recursive algorithms and will be covered in Lab09: Recursion.)