1.4. bubblesort method (22 points) a) Explain what is wrong with the given code. Describe the fault precisely by proposing a modification to the code. b) If possible, give a test case that does not execute the fault. If not, briefly explain why not. c) If possible, give a test case that executes the fault, but does not result in an error state. If not, briefly explain why not. d) If possible give a test case that results in an error, but not a failure. If not, briefly explain why not. Hint: Don't forget about the program counter. e) For the given test case below, describe the first error state. Be sure to describe the complete state. Hint: Don't forget about the program counter. array = 15,0,6,4,1,8,21; Expected = [0,1,2,4,5,6,8) f) Implement your repair and verify that the given test now produces the expected output. Submit a screenshot demonstrating your new program works. ** * Bubble sort algorithm to sort an array in ascending order * @param array the array to be sorted @throws Nutalaite exception if array is null */ private static void bubbleSort (int[] array) int temp = 0; for(int i = 0; i array[i]) { // swap elements temp = array ( 1); arraylj - 11 array[i]; array[i] = temp; } 1 2 // test: array = 15,0,5,4,1,8,2): Expected = 10,1,2,4,5,6,81