Define P_i to be a parking lane iin a parking lot and car_j to be the jth car; where the number of lanes in a parking lot is 4 and there are 7 cars to park.1<= i<=4, and C_j: 1<=j<=7. Assume that all lanes are of the same length, and all cars are also of the same length, hence, the same number of cars could be lined up in each lane. Only 5 cars can be lined up in each lane. However, different lanes have different lining up rules according to their data structures. The first parking lot lane is an array, the second is a single listed, the third is a stack and the fourth is a queue.

When a car arrives to the parking lot, the valet parking lot staff insert the car in one of lanes. However, customers may also ask the staff to get their cars back later. Keep in mind that any (inserting/ removing) operation (corresponding to moving any car into or out of any lanes) cost 1 KD.

Test the program on each data structure using the following lane operations

lane operation	Car Number
Insert
Insert
Remove
Insert
Insert
Insert
Insert
Remove
Insert
Remove
Insert
Remove