1) we covered binary tree and binary search tree. You are given a binary tree whose keys are integers. You need to test if this is a correct binary search tree. The rule is like this, the first number (first line) will show how many nodes there will be. The following lines will have 3 integers: the key of the node (keyi), the index of left child and (lefti) and the index of right child (righti). 1 means there is no child of the node. OUTPUT: If the given binary tree is a correct binary search tree, then "it is a binary search tree" will be printed. Otherwise, "it is not a binary search tree" will be printed. Example: Input: 3 511 712 9-I -I Output: it is a binary search tree 5 7 9 Use C language for writing your code. Create a word file and copy and paste your code. Submit your document into uzem. Otherwise, no homework will be accepted. Submit your document before the deadline