1. (25 points) The Divide & Conquer paradigm typically partitions the search space. (You may wish to review sample BST traversal code in the 2430 review materials). Explain a) Why Divide & Conquer algorithms are often implemented recursively b) What may recursive functions hide', thus yielding simpler code c) BST inorder traversal may be implemented iteratively with one local stack object d) BST postorder traversal is more difficult to implement iteratively e) Why a divide & conquer solution may yield exponential complexity