Implement a personal text-based assistant using BINARY SEARCH TREE

For this project, you will write a program that uses a Binary Search Tree to provide answers to user provided questions. This program will be similar in concept to the early AI and natural language processing program called ‘Eliza’. Eliza provided basic communication (often nonsensical) to directly asked questions. The concept and technology of ‘Eliza’ have been replaced with ‘Siri’, ‘Alexa’, “Echo”, and ‘Google Home’ but the concept of an automated personalized assistant certainly remains. This assignment will explore an introductory approach to building a text-based personalized assistant. Your program will be provided with a list of keywords and canned responses to initialize conversations. This information will be passed into your program by a file passed in by a command line argument. Once the conversation data is read and loaded into the Binary Search Tree the user will be presented with a menu system. The menu system must support adding/removing new rules. In addition, the menu system must support displaying the contents of the Binary Search Table and modifying the importance of a rule.