please answer the following java quesitons to get rated up in case the answer is correct, or down if its wrong.

Question5 1 pts Which sort algorithm begins with the algorithm below? start at index 1 copy array value into temporary storage compare temporary to index 0 - if element 0 is less than element 1, shift element 0 to element 1 put temporary value into element 0 bubble sort insertion sort selection sort Question 8 1 pts DIFFERENT FROM THE PREVIOUS QUESTION Given a 2-dimensional array of ints, what will the following code do? int sum-0; for (int r 0; rarray.length; r++, sum O) for ( ? 0: c array[r].length: C++) sum +arraylrlc]: System.out.println(sum); O O O Prints the sum of each column Prints the sum of each row Prints the sum of all the elements of the array Question 9 1 pts Which sort algorithm is described below? set top of unsorted array to 0 search array from top to end to find index of largest entry swap value at top of array with value at index of largest entry increment top repeat until end of loop O bubble sort O selection sort O insertion sort