Please code in javaPlease code in java

Problem Description - 1/1 You have an array A We call the array good KA impossible to do so -A[2*1+1] for all Find the minimum number of adjacent swaps you need to make the wygodo m An adjacent swap consists of choosing two consecutive Indices and swapping the values they hold. Nray Indexed Function Description Complete the minswaps function in the editor below. It has the following parameter(s: Name Type Type Description Parameters INTEGER ARRAY Ali] denotes i-th element of the array Return The function must return an INTEGER denoting the min adjacent swaps required to make the array good. Constraints . 15NS 2000 15 A[i] S 10^5 Input Format For Custom Testing The first line contains an integer, N, denoting the number of elements in A. Each line i of the N subsequent lines (where 0 si