Question . c) Compleie the following implementation of binane [9*4 each +4=40 Marks] reats ines as per commients String key: BSTNode ieft, right; pablic BSTNode(String k ) (key=k; left = right = null; ) class BST Tree ( BSTNode root; BST Treeo, root = null; BSI Node insertR key) I root - insertRec(root, key); I / calls insertReco BST Node insertRec(BSTNode root, String key) f recuesive function to insert in BST if (root = null) / // insert in empoy tree return root; if ( key root.key) 21. Set root pointer to new node 1. return root; // renurn the (iuschanged) root pointer void preorder0 I preorderRec(root); I I/ calls PreorderRec0 void preorderRec(BSTNode roof) \& i/ necursive uatiliy function for preorder traversal