Use the bubble sort algorithm

for (i = 0; i <= n 2; i++)

for (j = 0; j <= n 2 i; j++)

if (A[j + 1] < A[j])

swap A[j] and A[j + 1];

to sort the array [E, X, A, M, R, E, V, I, E, W] in alphabetical order. Show the contents of the array after three iterations of the outer for loop in the selection sort algorithm.(Please include all steps)