Please write this in java

In this lab we will see how many swaps are performed by the standard bubble sort. We will take a list which is already sorted, a list that is reversed sorted (or "worst sorted"), and an "in-between" case. You will output the sorted list and the total number of swaps performed each time. Write a program (you choose the language) which performs the following pseudocode. Begin Program Integer i, j, swapcount; Integer A[6];//array of size 6 A[1] = 11; A[2] = 13; A[3] = 17; A[4] = 23; A[5] = 29; A[6] = 31;//array already sorted swapcount = 0; for i = 1 to 5//or: for (i = 1; i A[i + 1] then {swap count = swap count + 1;//or swap count++; Swap (A[i], A[i + 1])} Next j Next i for i = 1 to 6//or: for (i = 1; i