Please, using Java programming language write a program that will complete the following problem and print the clique followed by the independent set

Make space for two piles of nodes: A and B. Then, starting with the entire graph, repeatedly add each remaining node a to A if its degree is greater than one half the number of remaining nodes and to B otherwise, and discard all nodes to which r isn't (is) connected if it was added to A (B). Continue until no nodes are left. At most half of the nodes are discarded at each of these steps, so at least log, n steps will occur before the process terminates. Each step adds a node to one of the piles, so one of the piles ends up with at least log, n nodes. The A pile contains the nodes of a clique and the B pile contains the nodes of an anti-clique. Make space for two piles of nodes: A and B. Then, starting with the entire graph, repeatedly add each remaining node a to A if its degree is greater than one half the number of remaining nodes and to B otherwise, and discard all nodes to which r isn't (is) connected if it was added to A (B). Continue until no nodes are left. At most half of the nodes are discarded at each of these steps, so at least log, n steps will occur before the process terminates. Each step adds a node to one of the piles, so one of the piles ends up with at least log, n nodes. The A pile contains the nodes of a clique and the B pile contains the nodes of an anti-clique