In the Bubble Sort Algorithm, the Following Code Accomplishes Swapping

Multiple Choice

In the bubble sort algorithm, the following code accomplishes swapping values in elements at positions index and index + 1.

A) list[index] = list[index + 1]
List[index + 1] = list[index]
B) list[index + 1] = list[index]
List[index] = list[index + 1]
C) list[index] = temp;
List[index] = list[index + 1];
Temp = list[index + 1];
D) temp = list[index];
List[index] = list[index + 1];
List[index + 1] = temp;