please answer these 3 questions ASAP!!! thank you!

Question 2 of 10 > A Moving to the next question prevents changes to this answer. 10 points Save Consider the following list of integer indexed from 1 to 8 (i.e intList[1]=35...., intList[83=38) intList[]* 135, 12, 27, 5, 18, 45, 16, 38) Consider the following pseudo code version of Bubble Sort (n=8) for ju1 to n-1 do for j=1 to n-1 do if intList[i] > intList[i-1] swap (intList[i], intList[i+1] ) What is the position (index) of the smallest element (5) after the first pass? a. 6 b. 2 C. 1 d. none of the above . Question 8 of 10 > A Moving to the next question prevents changes to this answer. 10 points Save Answer Consider the following list of integer indexed from 1 to 8 (i.e intList[1]=35,..., intList[8]=38) intList[= {35, 12, 27, 5, 18, 45, 16, 38} Consider the following pseudo code version of Bubble Sort (n=8) for j=1 to n-1 do for i=1 to n-1 do if intList[i] > intList[i+1] swap (intList[i], intList[i+1]) What is the position (index) of element 45 after the third pass? a. 2 b. 8 C. 5 d. 7 Consider the following list of integer indexed from 1 to 8 (i.e intList[1]=5..., intList[8]=45) intList[= {5, 16, 12, 18, 27, 35, 38, 45) Consider the following pseudo code version of Bubble Sort (n=8) swapped = true while (i intList[i+1] { swap (intList[i], intList[i+1]) swapped = true; } } How many passes through array intList are executed? a. 2 b. none of the above C. 3 d. 1<>