a.

b. c.

A car company has a large database about their customers. This includes the following fields: name, address, car model, month/year of manufacture, cost to produce, profit from sale. The company has realized that all cars manufactured in the last 8 months have a faulty part and so the company wants to issue a recall. The recall notice will be sent to the car buyers at their address in the database. Explain which indexing scheme, i.e. hash table or B+ Tree, you would use on what key, and what you would return. Justify your answer for full credit. Explain a situation when using a hash function for data that CAN be naturally ordered would make sense. 1. Show how the following tree can be represented in memory using pointers. 2. Update your answer if the number 45 were inserted into the tree. 50 40 70 80 75