This must be implemented using Java.

Overview: For this assignment you will need to write a program that will visually illustrate selection sort, insertion sort, and bubble sort. This program is to be used as an aid to help explain each algorithm to someone who has never seen the algorithms before. Therefore, you should have some way to visualize the date (see examples below), indicate in some way which values are currently being swapped, and have the animation be slow enough that someone not familiar with the algorithms can follow along with each step. You must invoke each sort method on a separate thread. You should create an array of integers that contains all the integers 1 through 50. Shuffle the values in the array randomly and have each algorithm start with the same array (you can use different copies for each thread). The initial arrays should be different each time the program is run. Display: There are many ways to display these algorithms as they sort. To help illustrate the types of animations we are looking for please view the following websites However, no matter how you choose to display your array, the display must be the same for all 3 algorithms and all 3 algorithms must be displayed and running at the same time. Note that while you do get to choose how the display will look we l take off points if your display is unappealing to a broad audience