Algorithms question: Please help if you can

1. Modify the fragment of pseudocode on p.40 named BUBBLESORT(A) so that it will implement bubble sorting algorithm with counting swaps.

Bubble sort pseudocode from page 40

for i=1 to A.length -1

for j=A.length downto i+1

if A[j] < A[j-1]

exchange A[j] with A[j-1]