Exercise 3.1 Suppose we wanted to use our tree as a binary search tree for Church numerals. Write expressions for the following functions. briefly describe how they work, but you do not need to give fully worked examples. (INSERT tr should return a tree which is the same as t, except with r inserted at the correct leaf position (reminder of the basic algorithm: if x is less than the element at the current position, move left, otherwise move right, until you find an empty place to put the element as a new leaf). (SEARCH t r) should return TRUE if r exists in t, or PALSE otherwise. (note: you don't have to implement a balanced binary search tree. An unbalanced one is fine.) xercise 3.2 (INORDER t) should return an inorder traversal of the tree as a list) Exercise 3.3 (SORT a) should sort a list using the treesort algorithm (make a binary search tree using the elements of the list, then return the inorder traversal of the tree as a list). Exercise 3.4 Modify your algorithm and data structure so that it accepts an arbitrary comparison function (instead of assuming we're always using numbers)