PLEASE GIVE THE RIGHT ANSWER AND I NEED PYTHON CODE.

PROBLEM 2 In Problem 1, you implemented the Movie management system. Now you have to re- implement the system by using BST You will implement and test an application that acts as main-memory database containing information about movies. All the records with movie information will be stored in a Binary Search tree container class. The insertion of each movie record will be based on the movie title. For simplicity we will assume movie titles consisting of either one word, or multiple words separated by a dash - . For example: Platoon, Alien, Titanic.. The following diagram illustrates a general level organization of a movies database for these three movies, when inserted in that order Platoon right left Alien Right = None Left = None Titanic Right = None Left = None In reality, each node will not have simply the movie title, but a record that has the following information: 1. Movie Title 2. Cast (Actors will be stored in linked list (singly or doubly or circular up to you. You can use your previous linked list code) 3. Movie year of release 4. Duration of the movie (minutes) You will implement the following operations for the movie database application 1. Add movie - add a new movie record to the movie database. You cannot insert the movie which already exist in the list. 2. Delete movie - deletes a movie record from the movie database. 3. Add actor - add an actor in given movie cast 4. Find movie - finds the information record for a movie 5. Find actor - Prints all movies in which actor has worked 6. Print movies in order - prints all the movies in the list sorted order. Bonus Points Saving and Restoring BST using a text file - Your program will read the data from an input file in order to create Movie BST and its actors' linked list. At the exit, your program will be able to save the data in the file