Read the following to answer the question (10 marks) public static int ( bubbleSort(int[] numArray) int n numArray.length; int temp = 0; int i=0; while (i numArray[j]) { temp = numArray[j - 1]; numArray j - 1] - numArray()); numArray[J] - temp; ) j++; *++; return numArray, 1) Is T adequate to properly test the bubble sort function above using statement coverage criterion? Show full analysis to get the mark. T:{ t1: E/O=[1,2,3]> E/O=(1,2,3) E/O=11,4,5)<>