Use a Sorting Algorithm when sorting

50 10 60 0 100 30 20 40 80 70 Part A - Binary Search Tree (BST): Using the list/array of integers above, write a Python, C++, or Java program that places (or inserts) this list/array of integers into BST format. Next, this program should conduct a preorder OR postorder traversal on this same BST in its current state. Third, the program should conduct a search for a given node in the BST based on the user's input. Fourth, the program should insert a new node into the BST based on the user's input. Fifth, the program should delete a given node from the BST based on the user's input. Finally, the program should conduct another preorder OR postorder traversal on the BST in its final state. Part B - Sorting Algorithms: Based on the traversal option you choose to use in Part A (preorder or postorder), take the BST, in its final state, and place (or append) each node (in their current traversed order) into a list/array and sort them in ascending order using any sorting algorithm of your choice. Please note in your final print statement which sorting algorithm is being used (see output below as a point of reference).