Part b. [3 points] A Binary Search Tree (BST) stores keys/values following the Symmetric-order, i.e., all values smaller than a key go left, all values larger than a key go right. Write the insert method for a BST that stores integers as keys. Assume duplicates (equal keys) are not allowed. publio void insert (Node N ) \{