Ordered Binary Trees Here we would like to define an OrderedBinaryTree as a data type where for each node with label n, all of the children in the left sub-tree have labels smaller than n, and all the children in the right sub-tree have labels larger than n Base case: null E OrderedBinaryTree. -Constructor case: if t1,t2 E OrderedBinaryTree and n E N, and (empty(ti) V maximum(ti) n) and You may assume all the other tree operations (including traverse from question 5) are defined for Tree. OrderedBinaryTree s also. 7. Define the minimum : OrderedBinaryTree N and maximum : Ordered inaryTree N opera- tions used in the definition of OrderedBinaryTree above. (pi,P2, . . . ,Pn) is an (*) Prove that Vt E OrderedBinaryTee. traverse(t) is an ordered list. (A list, p ordered list if Vi e 1,--.,n -1).pi