can you please write the java code with test main

Define P to be a parking lanei in a parking led car to be the jh car, where the number of langs in a parking lotis 4 and there we 7 ans to park 14 and 1-7. Assume that all lunes are of the same length and all cars we also of the same length, hence, the same number of cars could be lined up in cache lane Only cars can be lined up in cach lane. However, different lanies have different lining up roles according to their data structures. The fint parking lot lane is an arnes, the second is a single listed the third is a stack, the fourth is a queue Structure Parking lot line P Amay P Single Linkedin Suck P P Q 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 my cinto or out of any lunes) cost I KD CPE 207 Duta Structures Fall 2030 2031 Test the program on cach data structure using the following linen operations lane operation Car Number C C Insert Remove Insen Insert Insert Insert Remove Insert Remove Insert Remove C C: C