Question no 02: Write a program in java in which you have an array b containing n integers. Initially the integers are in some random order. You would like to rearrange the array so all the negative integers precede all the zeros, and the positive integers appear at the end. In pictures, we would like to rearrange the contents of b so that at the end we get the following picture: 1 N <0 >0 b And then insert the elements of b array into an initially empty BST such that the tree produced is equivalent to binary search tree.