Write down the algorithms to find the following from a given binary search tree. i$)$ The largest element of the tree ii$)$ The smallest element of the tree iii$)$ The inorder successor of a given key of the tree iv$)$ Sorted list of the keys of the given tree.