Part 1.1: just create some random data according to the question.

INTRODUCTION Your second assignment in this block will be using binary search tree data struture for implementing a small Sale Management System (SMS) in Java language. SMS manages information about products, customers and product ordering items. These information are: About a product 1. pcode (string): the code of the product (this is the key of the tree and thus should be unique) 2. pro name (string: the name of the product. 3. quantity integer): the number of products with the same code in a shop at beginning of a day 4. saled (integer): the number of products with the same code, which are saled in the day. Condition: saled s quantity. 5. price (double): The price of the product. About a customer: 1. ccode (string): the code of the customer (this should be unique for the customer) 2. cus name (string): the name of the customer. 3. phone (string): The phone number of the customer (must contain digits only). About ordering: 1. pcode (string): the code of the product to be ordered 2. ccode (string): the code of the customer 3. quantity integer): the number of ordered products YOUR TASKS You should use 1 binary search tree to store data for products and 2 inked lists, each one is used to store data for customers or ordering items. You should create the data structures from scratch, do not use structures available in java. On running, your program displays the menu as below: Products (8 marks (using Binary Search Tree data structure, where bcode is the key of the tree) 1.1 Load data from file 1.2. Input & insert data. 1.3 In order traverse 1.4 Breadth-first traverse 1.5 In-order traverse to file 1.6 Search by pcode 1.7 Delete by pcode by copying 1.8 Simply balancing 1.9 Count number of products