LinkedList$()$;

$$ LinkedList$()$;

bool findCar$($int aVin$)$;

bool addCar$($string model, string make, int vin, double price$)$;

bool removeByVin$($int aVin$)$;

bool removeByModelAndMake$($string model, string make$)$;

bool changeCarInfo$($int aVin, string newModelAndMake$)$;

bool updateCarPrice$($int aVin, double newPrice$)$;

void printCarListByMake$($string make$)$;

void printCarList$()$

$\}$;

In this assignment, according to above class definition, you need to finish each of above functions according to the following description.$($within LinkedList.h file$)$

$\backslash$table$[[$Function$,|$Function$\text{'}$s Description$],[$LinkedList $()$;$,$This is the constructor of the LinkedList class. It creates an empty linked list by initialing the head to be NULL.$],[$L LinkedList$()$;$,\backslash$table$[[$This is the destructor of the LinkedList class. It should delete all Car objects in the linked list and perform garbage collection $($free the memory$).$ At the end, it should print:$],[$The number of deleted Car is: $??],[$where $??$ is the number of deleted Cars in the linked list.$]]],[$bool findCar$($int aVin$),\backslash$table$[[$This is the linear search function in LinkedList class. It search the linked list by the given parameter vehicle identification number aVin, if it found the Car with the$],[$corresponding aVin inside, it returns true, otherwise it returns false. Note: each Car has an unique vin, i$.$e$.$ it's possible that two Cars may have the same model and make,$],[$but their vins must be different.$]]],[,\backslash$table$[[$This function adds a new Car into the linked list by using the parameter values $-$ model, make, vin and price of the Car. It needs to create an object of the struct Car and add$],[$it inside the linked list at a correct location.$],[1.$ First, the Car should be added in alphabetical order of their makes, if two or more Cars have the same makes, then it should be added according to their models, again in$],[$alphabetical order.$],[2.$ If two or more Cars have exactly the same model and make $($possible$),$ then they should be added in the increasing order of their vins. Note: each Car has an unique vin.$],[3.$ If the Car was added successfully inside the LinkedList, the function should return true; otherwise the function returns false.$]]]]$