Write a program in java which reads a sequence of integer values from input- values should be separated by space. This program should Build a binary search tree using these values in the order they are entered. Print it in 3 traversal methods: pre-order. In-order, and post-order. Allow the user to Add or Remove a value. Once a new tree is generated, print it in in- order traversal . NOTES . Use recursion to implement add and remove methods, otherwise you will lose points . Duplicates are NOT allowed in this BST. At the very first step after obtaining initial values check for duplicated values. In case of any duplication asks user to enter values again .Your program should use an interactive interface with the format shown in following demo example (the user inputs are underlined) % java Project 1 Please enter values: 26 34 19 12 40 51 29 44 77 60 84 1199 41 36 22 16 Duplication values are not allowed! Please enter values 26 34 19 12 40 51 29 44 77 60 84 11 941 36 22 1615 Pre-order: XXX X In-order XXX...X Post-order: XXX... X Main Menu A: Add a value R Remove a value E : Exit the program What command would like to run? Please enter a value to add: 27 In-order: XXX...X what command would like to run? Please enter a value to add: 11 11 already exists! Duplicated values are not allowed. What command would like to run? R Please enter a value to remove:12 In-order: XXX... X What command would like to run? R Please enter a value to remove: 10 10 doesn't exist What command would like to run? E Exit