1. The following is a Java representation of an algorithm that takes an array of integers and sorts them in ascending order. A. [20] What is the order of this algorithm in the worst case? Explain your answer in detail. B. [10] What is the order of the algorithm if the array is already sorted? Justify your answer. public void exampleSort(int[] arr) arr.length; int n int temp E for (int i 0; i arr(j + 1]) { temp arr[j]; arr[j] = arr(j + 1]; arr[j + 1] temp; }