Write a java code implementing 2-3-4 tree using insertion and deletion such that:

You cannot use: "java.util.LinkedList" and "java.util.Queue"

Starting with an empty tree, perform the following insertion operations:

insert(22) insert(1) insert(9) insert(34) insert(77) insert(39) insert(01) insert(69) insert(43) insert(86) insert(20) insert(99) insert(22) insert(52) insert(89) insert(17) insert(11) insert(33) insert(75) insert(37)

And then do the following deletions:

delete(99) delete(22) delete(11) delete(9) delete(24) delete(75)