Exercise 16 What's wrong with the following code for adding an element to a BST? public boolean add(E item) f root - add (root, item) return addReturn; e private Node add (Node localRoot, E item) if (localRootnull) // item is not in the tree, insert it. addReturn true; return new Node (item); 10 else if (item.compareTo (localRoot.data) 0) // item is equal to localRoot.data addReturn false return localRoot; 12 14 else if (item.compareTo (localRoot.data)