Student Name Student ID CS209 Data Structures and Algorithms-Quiz 1 /2e Friday, Feb 22, 2019 I. (25 points) Here is an array of five integers: 5,3,4,2.1 Please draw this array after EACH iteration of the large loop (outer loop) in a Bubble sort (sorting from smallest to largest) 2. (25 points) Here is an array of five integers: 5,3,4,2,1 Please draw this array after EACH iteration of the large loop (outer loop) in a Selection sort (sorting from smallest to largest). 3. (25 points) Here is an array of five integers: 5,3,4,2.1 Please draw this array after EACH iteration of the large loop (outer loop) in an Insertion sort (sorting from smallest to largest). 4. (25 Points) Give a big-Oh characterization, in terms of n, of the running time of following method. public static void FindRepeated( int] arr) int length arr.length: int temp fortint i-O.iclength-i++y/ outer loop forfint j-Ojclength-I-ij+ inner loop temp arrli 1 ari+1]-arrD) arri) temp forint i-O.iclength-li++y System.out printin Repteaded number.+ ai+)