Create a user-defined data structure (struct) called Node that represents a node within a linked list where the "data" stored in each node is a pointer to a Car object.
a) Write a function called insertCarIntoList that takes creates a new Car (using the createAndInitializeCar function) and inserts it at the end of a given linked list of cars.
b) Write a function called deleteCarFromList that takes a VIN and deletes the Car in a given list that has the given VIN. If the car with the given VIN is not found in the given list, display an appropriate message to the user.
c) Write a "main" function that defines an external pointer to point to the beginning of a linked list of cars and repeatedly calls insertCarIntoList as long as the user wishes to continue to insert new nodes into the list pointed to by the external pointer. Once the user is done inserting nodes, ask the user to enter a VIN and then call the deleteCarFromList function to delete the Car with VIN from the list created above.