With both programs #4 and #5 you will be implementing your solutions using Java. Your goal must be to develop an object-oriented solution but this time implement it in Java. Make sure that your OO Design is not centered around your data structures your data structures support the design but shouldnt be the primary emphasis of your design. You may use Eclipse or IntelliJ to develop your software. Your Java programs must follow these rules:

For each of the above that you experiment with, write up information about it in your efficiency write-up

You are required to turn in a paper on how this solution is object oriented (your design). There is ONLY ONE design writeup for the combined programs 4-5. But, with EACH program, you are required to write 400 words about the efficiency and IDE (rather than the debugger).

Data Structures

In these last two programs, you must implement two data structures:

1. Program 4:
   1. If you have already implemented a balanced tree in a previous assignment: A Binary Search tree, implementing insert, display, retrieve, retrieve all related items, remove an individual item, and remove all; the algorithms must be implemented recursively.
   2. If you have not yet implemented a balanced tree, then:

A red-black tree, implementing insert, display, retrieve, retrieve all related items (no remove individual items).

1. Each node needs to have a root pointer to a binary search tree for all items where the key matches. This means there can be duplicate data but will only appear in one nodes data structure.
2. Program 5: A linear linked list of arrays.

The required data structures specified in the assignment must be your own implementation: as in BST (or balanced tree) and linear linked lists. Once you meet the basic requirements of the assignment, you are allowed to use libraries for any subsequent data structures.

Start by looking up how to use Grubhub, and get an idea of what information it contains. Here is a brief list of what I came up with: Location (city, state/region,

Here are some suggestions on where to use the data structures assigned. These are JUST suggestions; you may adjust how the data structures are used:

1. Program #4 A tree of restaurants (or cuisines) supported by our program, where each node is a tree of the most popular foods available for delivery or pickup.
2. Program #5 A linear linked list of my order, where each array holds the details of the order (ingredients as appropriate, prices, special instructions, etc.).

Your job is to come up with a design of an OO framework that will support an meal plan and food ordering type of application. Although you all have the ability to write this using procedural abstraction, the key is to make sure to solve this problem using Object Oriented methodologies with dynamic binding and function overloading. The use of external data file(s) are necessary!