Write a program that takes as input an unordered list of integers, creates a Btree of minimum degree t=4 and then outputs the sorted list of integers. A simple inorder traversal of the B tree will output the list of the integers in a increasing order. Can someone show me how to implement this in Java?

This is what I have so far

public class Btree {

public static void main(String[] args) { // creating a scanner Scanner input = new Scanner(System.in); // Creation of random number object Random randomNumbers = new Random(); // creating a local varible int num; int [] array = new int [7]; // generate the numbers for random for (int i = 0; i < array.length; i++) { array[i] = randomNumbers.nextInt(100); } // end of the for loop } // end of the main