JAVA

Consider sorting n numbers stored in array A by first finding the smallest element of A and exchanging it withthe element in A[1]. Then find the second smallest element of A, and exchange it with A[2]. Continue in this manner for the first n-1 elements of A this alforithm is known as selection sort.

1. Implement the selection sort.

2. Implement the insertion sort. (For problem 1 and 2, you can let the user input the array or your program generate a random array.)