#1. Use the selection sort algorithm to sort the list E, X, A, M, P, L, E in alphabetical order. Show the contents of the array after three iterations of the outer for loop in the selection sort algorithm.

#2. Implement your revised algorithm for Bubble Sort in Java.

Your program should prompt the user to enter a list (i.e., 1-D array) of integers to be sorted, output the unsorted list, and then output the sorted list in ascending order. Assume a maximum list size of 15 integers.

Be sure to write a modular program. In this exercise, your main method should call two other methods, namely bubbleSort and printArray.