L A Moving to the next question prevents changes to this answer. Question 7 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 first pass? O a. 8 O b.5 c. none of the above d. 2 nges to this answer. Moving to the next question prevents changes to this answer. Question 5 Consider the following list of integer indexed from 1 to 7 (i.e intList[1]=35..., intList[7]=38) intList[]= {35, 12, 27, 18, 45, 16, 38} Consider the following pseudo code version of Bubble Sort (n=7) 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] ) How many passes through the array inList are executed? Qna. 4 046.5 O c. 6 O d. 7 hanges to this