Starter Code:

import java.util.Scanner;

public class BubbleSorter { public static void main(String[] args) { Scanner sc = new Scanner(System.in); // Read in the list of numbers int[] numbers; String input = sc.nextLine(); if (input.equals("")) { numbers = new int[0]; } else { String[] numberStrings = input.split(" "); numbers = new int[numberStrings.length]; for (int i = 0; i

// Sort the list bubbleSort(numbers);

// Print the sorted list StringBuilder resultSb = new StringBuilder(); for (int i = 0; i

Code in Java, post full answer with starter code included, will rate if correct

(20 points) In this problem, you will write an implementation of Bubble- Sort. Your function should take in a single line representing an array of integers, and output a single line containing the list in ascending order For example, if you receive the following input followed by a newline 8 7 6 5 4 3 2 1 then you should display the following output followed by a newline: 1 2 3 4 5 6 78 Starter code for reading the input and writing the output has been writ- ten for you in the BubbleSorter class. Your job is to implement the bubbleSort) function. Any code that does not explicitly imple- ment the BubbleSort algorithm will receive a score of zero for all categories. Additionally, you must implement an algorithm with worst- case running time in O(n2), best-case running time i usage in e(1) to receive full credit for design. n (n), and space