Balanced Search Tree Write a program (in Java) that can convert a sorted array into a balanced binary search tree. For this project, a balanced binary tree is one where the size of the left and right subtrees at each node differs by at most one. Your program should have a graphical user interface. The program allows the user to enter a number n, generates an array of n random integers, sorts the array, and then converts the sorted array into a balanced binary search tree. The program should display a graphical representation of the binary search tree. Show all the leaf nodes; Show all the nodes in PreOrder, InOrder and PostOrder traversals.