Which of the following sort algorithms is represented in the pseudocode? Loop while i < size - 1 index = i Loop while j between(i + 1 and size) if data[j] < data[index] index = j temp = data[i] data[i] = data[index] data[index] = temp (1 point) Responses bubble sort bubble sort quicksort quicksort selection sort selection sort merge sort
