java language

For the following questions, you will implement the data structure to store information used by a local car dealer. Each car has some information and stored in a text files called cars: Write a main program for all questions to let the user enter, delete, search for information, and print current cars stored in the data structure. Cars.txt formatted so car records separated by a blank line. Each record contains (in order, each in a single line): ID, Make (manufacturer), Model, Year, Mileage, Price. For each question below, write a driver main method to test your implementation. Use ID as a key to search or delete in your methods. Q1) Implement a double linked-list to store cars data. Write a double linked-list class including search, delete, append (to the head and tail), and remove (from the head and tail). Q2) Implement a LIFO stack of car data using a linked-list. Q3) Implement a min-heap of cars data that can extract the car with the lowest price. Write a min-heap class including heapify, build heap, extract, and insertion. Q4) Implement a binary search tree of car data. Write a BST class including search, insertion, and deletion. cars 55 BMW 228i 2008 122510 7800 65 Honda Accord 2011 93200 9850 45 Toyota Camry 2010 85300 9500 25 Honda Civic 2010 86400 9100 15 Mazda Zoom 2013 72450 25 Honda Civic 2010 86400 9100 15 Mazda Zoom 3 2013 72450 8950 35 Mazda 0x7 2009 102200 7300 5 Toyota Corolla 2013 68900 10100 75 Ford Mustang 2008 112500 13200 85203