(1) Objective: Binary Search Tree traversal (2 points) Use traversal.pptx as guidance to write a program to build a binary search tree Dictionary. Input records are from inventory.txt. The data for the BST Key E KVpair are; Key is the Pa record from the input record. Download traversal-lab.pptx, inventory.txt, BinNode,java, BSTNode.java, BST java, Dictionary java and Inventory java from Moodel rtNo and Element is the Inventory Perform specifications as follow: (a) Provide Delete and Retrieve functions for user to access the database. (b) Modify BST.java to add printpostOrder printpreOrder methods. At the end, display inorder, postorder and preorder of the tree. (2) Objective: Provide range search function for Dictionary (2 point) Add printRang method to BST.java that, given a low key value, and high key value, print all records in sorted order whose values fall between the two given keys. (Both low key and high key do not have to be keys on the list) (1) Objective: Binary Search Tree traversal (2 points) Use traversal.pptx as guidance to write a program to build a binary search tree Dictionary. Input records are from inventory.txt. The data for the BST Key E KVpair are; Key is the Pa record from the input record. Download traversal-lab.pptx, inventory.txt, BinNode,java, BSTNode.java, BST java, Dictionary java and Inventory java from Moodel rtNo and Element is the Inventory Perform specifications as follow: (a) Provide Delete and Retrieve functions for user to access the database. (b) Modify BST.java to add printpostOrder printpreOrder methods. At the end, display inorder, postorder and preorder of the tree. (2) Objective: Provide range search function for Dictionary (2 point) Add printRang method to BST.java that, given a low key value, and high key value, print all records in sorted order whose values fall between the two given keys. (Both low key and high key do not have to be keys on the list)