Implement a class Queue which can hold unknow number of car objects using linked List Data structure .

Queue follows First-In-First-out ( FIFO) methodology , i.e the data element pushed first will be popped first

The implemented class should perform the following functions :

1) Push : insert data item into the queue

2)pop : Remove data item from the queue

3)is exist : check if the queue has a car with certain ID or not

4) clear : Delete all the queue nodes

Please Explain the steps Thanks .