You will be given a binary tree represented as an array. your job will be to verify if it is a binary search tree or not. input will be given as a space-separated array representing a binary tree as we discussed in class, with the root node occupying the oth index, the root node's children occupying indices 1 and 2, their children occupying indices 3-6, etc. all trees will be balanced, and will be filled left to right in the bottom layer. for example, the array [10,5,15,2,7,11,25,1] represents the below graph 10 15 25 thus, if you are given the following input 10 5 15 2711 251 then you should print true since this tree is indeed a binary search tree. as another example, the input 2 4 5 does not represent a binary search tree since the number 2 is less than both its children (4 and 5) restrictions: your algorithm must run in time o(n), where n is the num ber of nodes in the graph. any algorithm that does not wll be docked points for correctness as well as design. in addition, any algorithm that returns true on all possible inputs or false on all possible inputs will re- ceive a grade of zero in all categories. code for reading input and writing output has been provided in the class binarysearchtreechecker; your job is to complete the isbinarysearchtree ) function