$($e$)$ The parking lot of carpark has the given layout. There is one lane going into the car park and one

way out of the car park. The parking slots have labels PL$1,$ PL$2$ and PL$3.$ The parking slot PL$2$ has

capacity for four $(4)$ vehicles while PL$1$ and PL$3$ have three each.

The vehicle v$2$ wants to leave the carpark, show how this could be achieved using the push, pop,

enqueue and dequeue operations based on PL$1,$ PL$2$ and PL$3$ being the stacks and Q$1$ and Q$2$ being

queues. There are two vehicles $v3$ and $v7$ behind $v2.$ Three vehicles $v4,v5$ and $v9$ are parked in

parking slot $1($PL$1)$ and two vehicles v$6$ and v$8$ in PL$3.$

Your simulation using stack and queue data structure operations should show different

configuration of vehicle movement to and from the carpark at various stages to achieve the perfect

result so that after v$2$ had left, the configuration at PL$2$ should show v$1,$ v$3$ and v$7$ restored.