Use JAVA programming language to implment the "deletion" operation of (2,4) tree, reappear the example of Figure 11.27 and 11.28, just like the below two images, just print the tree after deletion the nodeYour program should print out all the Similar trees in this two images! I will definitely give you helpful evaluation if you finished it, thank you!

Figure 11.27: A sequence of removals from a (2,4) tree: (a) removal of 4 , causing an underflow; (b) a transfer operation; (c) after the transfer operation; (d) removal of 12 , causing an underflow; (e) a fusion operation; (f) after the fusion operation; (g) removal of 13; (h) after removing 13. Figure 11.28: A propagating sequence of fusions in a (2,4) tree: (a) removal of 14 , which causes an underflow; (b) fusion, which causes another underflow; (c) second fusion operation, which causes the root to be removed; (d) final tree