1. The binary search tree operations can also be implemented iteratively. Design and implement an iterative solution for each operation:
(a) search
(b) find minimum
(c) insert
(d) delete
2. Design and implement the function bstMaximum(), which finds and returns the maximum key value in a binary search tree.