2. Traversals - Modify the following preorder traversal to perform an inorder traversal of a binary tree. (5 points) template void preorder (BinNode * root) { } if (root == NULL) return; // Empty subtree, do nothing visit (root); preorder (root->left () ); preorder (root->right () ); // Perform desired action