Using an object-oriented language of your choice, build a class called BST with the following methods:

1. void add(int i)

2. bool contains(int i)

3. void inOrderTraversal() /* writes the values of the tree to standard output using an in-order traversal */

4. void preOrderTraversal() /* writes the values of the tree to standard output using a pre-order traversal */

5. void postOrderTraversal() /* writes the values of the tree to standard output using a post-order traversal */

Include a separate class with a main method that demonstrates all of the class functionality. You may implement the BST with either an array or a linked structure.