This is for the Java and everything is in the one file and please follow the instructions given on the assignment

(2) Faceboc Lecture No 1 ECE3522,F I M Differential M Java-F u/1/ #inbox/15f7e50ddac 101c5?projector= 1 1 Sorting For the first part of this assignment, you will be implementing two very well known sorting algorithms, which I went over during lecture. Sorting algorithms sort arrays from the smallest value to the largest value. Be sure you are able to explain them to your TA or me when you demo. 1.1 Bubble Sort Create a method bubbleSort that performs a bubble sort of an array. The bubble sort algorithm examines all adjacent pairs of elements in the array from the beginning to the end and swaps any two elements that are out of order. Each interchange makes the array more sorted than it was, until it is entirely sorted. The algorithm in pserdocode follows: Bubble sort algorithm to sort an array a Repeat the following until the array a is sorted: for (index - 0; index a [index 1]) Interchange the values of alindex] and alindex 1] A good visualization of the algorithm in action can be found at: https: //en.vikipedia.org/wiki/Bubble sort/media/File:Bubble-sort-example-300px gif DOi a w @e@