Write a Java program to implement "Bubble Sort".

This algorithm uses nested loops to make several passes through the array of integers. Each pass compares successive pairs of elements.If the pair is in increasing order (for ascending sort) they left as is. Otherwise they are swapped. First pass compares elements 1 and 2. Next pass compares elements 2 and 3 and so on. The last pass compares last two elements and swaps if needed. After one pass the largest element will be in the last index. After 2 passes the two larges elements will be in the last 2 positions and so on.

For this program, ask the user to enter a number (integer) that represents the number of elements to be sorted. Then, generate a that many random integers and store them in an array. First print out the unsorted array. Then sort it and print out the sorted array. You can do all this in ONE Java program.