Give a Java implementation of the adoptable priority queue based on a sorted list. You are required to use a default comparator (built in Java) and a comparator for nonnegative integers that determines order based on the number of 1s in each integers binary expansion, so that i < j if the number of 1s in the binary representation of i is less than the number of 1s in the binary representation of j. Provide a main function to test your comparators using a set of integers.

Please who can help with this question in Java