The Scratchemup parking garage contains a single lane that holds up to 10 cars. Cars arrive at the south end of the garage and leave from the north end. If a customer arrives to pick up a car that is not the northernmost, all cars to the north of his car are moved out, her car is driven out, and the other cars are restored in the same order that they were in originally. Whenever a car leaves, all cars to the south are moved forward so that at all times all the empty spaces are in the south part of the garage. Write a program that reads a group of input lines. Each line contains an a for arrival and d for departure and a license plate number (example: 979WJC). Cars are assumed to arrive and depart in the order specified by the input. The program should print a message each time that a car arrives or departs. When car arrives, the message should specify whether or not there is room in the garage for the car. If there is no room for a car, the car then proceeds to the Knockemdead garage...which is similar to the Scratchemup. There is room for 8 cars at the Knockemdead garage. If both garages are full, cars wait in the street near the Scratchemup garage for a space...and of course they are queued up in the street. The size of the street queue is also 8.So in summary, when a car arrives it tries to park in the Scratchemup garage. If there is no room, it goes to the Knockemdead garage. If there is no room there, it waits in the street. A message indicates which garage it is in (or the street). When room becomes available, and a car moves from the street to one of the garages, another message should be printed. When a car departs, a message indicates that a car has departed and also indicates which garage (or the street). This departure message should also include the number of times the car was moved within the garage (including the departure itself, but not the arrival). This number is zero if the car departs from the street and not from one of the garages.