Task: Write a Java program that will implement a templated Binary Search Tree (BST) data structure. The developed program should have the following functionality: Insert the specified value into the BST. Delete the given node as well as restructure the tree accordingly so no other data can be removed or lost. Find out the maximum value in the BST. Traverse the tree by implementing either inorder, preorder, or postorder traversal. Write your program to read from an array of unsorted integers for the evaluation of this data structure. Make sure to include tests for attempting to remove a node from an empty BST, attempting to insert a duplicate node, removing a node with no children, removing a node with one child, and removing a node with two children. Conduct a performance analysis of your developed BST and record the amount of time it takes to add and remove the following: 50 nodes 150 nodes 300 nodes You are supposed to use Java swing package to make your program user friendly. Requirements: You are supposed to use the following data structures: o Linked list Create a video demonstrating your source code functionality. Submit a simple report that contains: a. Introduction A small introduction about the project problem Describe the structure and operations of linked lists. b. Discussion and Analysis Reasons of choosing the data structure you used. Detailed documentation describing your implementation of linked lists Describe the structure of the list class. Describe the meaning and operation of each of its member variables and methods. For each member function, give a usage example. Determine the run time complexity (worst case) of the BST algorithm and its operation. Document your calculation in this section. Does your calculated run-time complexity match the measured run-time complexity? Why or why not? Source codes of the application. Screen shot of the application and output Present your working application for 10 minutes + 5 minutes Q&A. Your presentation should include: a. Description of the application. b. Reasons of choosing the data structure you used c. Running time of the application