Use a bubble sort to rearrange the following list into descending order, showing the list of numbers after each iteration (step/pass): How many comparisons is done in the second iteration (step/pass)? How many exchanges (swaps) is done in the third iteration (step/pass)? Write a PROCEDURE that takes one double parameter and then check if the number is positive, then it will print "The number is positive ". If the number is not positive, it will print "The number is negative". What is the runtime of this code? Function check (n : integer) \{ for (int i=0;i<>