Consider the following pseudocode algorithm: for i = 0 to list.length-1 { sorted = true for k = 0 to list.length-2-i{ if (list[k] > list[k+1]) { list.swap(k, k+1) sorted = false if (sorted) { break How many iterations of the outer loop does the algorithm execute to sort the list {1,9,7,8,3,5,6,2,4} ? How many iterations of the outer loop does the algorithm execute to sort the list {1,9,7,8,3,5,6,2,4} ? 05