Look at psuedocode for Counting sort and write a Java program that sorts elements of array A based on the pseudo code of counting sort with the following requirements:

A$.$ argument for the program is array A only $($without B and k if you see the book$)$

B$.$ elements of A can be any negative or positive integers $($from $-2,147,483,648$ to $2,147,483,647)$

C$.$ only $2$ arrays are allowed in a program $($e$.$g$.$ A and C for the book code: A for input$/$output and C for counting the elements$)$

D$.$ provide short and revealing comments that explain the program.