Write a Java program that takes a binary tree of size n as input and check if the binary tree is a Binary Search Tree $($BST$)$ or not. If the tree is a BST print $$It$$s a Binary Search Tree$$ if not print $$It$$s not a Binary Search Tree$.$ Note: The input must be dynamic on each execution. Every time you run the program; the program should ask you to input$-1.$ Size of the tree $($n$)2.$ Binary tree of size n$.($Input the nodes of the binary tree in any order you prefer, but you must specify in your code the sequence in which you intend to input the nodes of the tree $($e$.$g$.,$ pre$-$order, post$-$order, in$-$order$)).$