CESC 3130 Que Thursday, Feb 13, 2020 Using selection sont algorithm, show the first few pass of sorting this way: A = 7.5.9.9.8) wwap J 4A 4. 4 vap. Sharap What is something that is possible with a doubly linked list but not with a simple linked last? A abil loop iterates through an array of elements, incrementing with the index i+ 1 at each pass. How many steps will it take to iterate through that REN? Give the worst case Big O notation for the answer What is the time complexity for this code using loop analysis? Give the worst case Big O notation for the answer int sum - O: for (int i = 1; I