How many swap(s) is/are required to sort an array of n-5 integers: (33, 54, 31, 37, 321 using this version of Bubble Sort?

How many swap(s) is/are required to sort an array of n=5 integers: [33, 34, 31, 37, 32] using this version of Bubble Sort? for (j = 0; j A[i+1]) swap (A[i], A[i+1])