Code in c++ language please use all the priority queue classes. I made a priority queue class. I also provided the test file to check if it works. Make sure it passes all the tests. The output should...

Code in c++ language please use all the priority queue classes. I made a priority queue class. I also provided the test file to check if it works. Make sure it passes all the tests. The output should look like thisuser enter

1 departing false 1

0 2 departing false 1

0 3 departing false 1

0 4 arriving false 3

output is --->

Time step 0

Entering simulation

0 1 departing false 1

0 2 departing false 1

0 3 departing false 1

0 4 arriving false 3

Runway A

0 1 departing false 1

Runway B

0 4 arriving false 3

Time step 1

Entering simulation

Runway A

0 2 departing false 1

Runway B

0 3 departing false 1

use test file to check the outputs and input.

CSCI 311 - Algorithms and Data Structures Project 2 CSCI 311 - Algorithms and Data Structures Project 2 March 10, 2022 In this project, we will simulate takeoffs and landings at a small airport. As in the first project, there is very little direction regarding how to design or structure your code. These decisions are mostly left to you. Make sure to start early and to stay organized. This project is worth a total of 200 points. C++ code for this project should be submitted on Blackboard and turnin. The project is due before April 24th at 11:59 pm. All code and tests should be included in a .zip file called Project2. Your main should be written in a file called AirportDriver.cpp. You may, and I recommend that you do, include additional files to help organize your code. Remember, coding style and comments matter. Poor style or a lack of comments may cost you points! There will be time in lab to discuss these problems in small groups and I highly encourage you to collab- orate with one another outside of class. However, you must write up your own solutions independently of one another. Feel free to communicate via Discord and to post questions on the appropriate forum in Blackboard. Do not post solutions. Also, please include a list of the people you work with in a comment at the top of your submission. Good luck! 1 The Simulation Our goal is to simulate takeoffs and landings at a small airport with two runways, A and B. Aircraft will arrive at or leave from the airport at discrete time steps. More than one aircraft may enter the simulation at each step but only one aircraft may use each of the runways at a time. Each aircraft will have a time at which it enters the simulation, an ID, an indication as to whether it is departing from or arriving at the airport, an indication as to whether or not an emergency takeoff or landing is required, and a priority. Aircraft should be dealt with in the order defined first by their priority, then by the time at which they enter the simulation, and finally by their ID. Emergencies have top priority and are dealt with in the order in which they become emergencies. If an aircraft is waiting for more than 10 time steps, it becomes an emergency. Runway A should prioritize takeoffs while runway B should prioritize landings. In particular, unless there is an emergency situation or there are no aircraft waiting to takeoff, runway A should only be used for departing aircraft. Similarly, unless there is an emergency situation or there are no aircraft waiting to land, runway B should only be used for arriving aircraft. Emergencies should try to use runway A before runway B. 1 https://turnin.ecst.csuchico.edu/ https://discord.gg/dNU8Ty6apz https://learn.csuchico.edu/webapps/blackboard/content/listContentEditable.jsp?content_id=_4935228_1&course_id=_162050_1 At each time step, 1. Add any new aircraft to the simulation 2. Perform actions for runways A and B 3. Update priorities 4. Increment time It is possible for an aircraft to enter the simulation and leave (takeoff or land) in the same time step. 2 Input and Output Your program should read input from cin. This is intended to allow you to enter test cases by hand or by providing a file as input directly from the terminal. For example, suppose you compile your program to a.out and that you have a file named “test 1.in”. Then running ./a.out < test_1.in="" will="" run="" your="" program="" using="" the="" lines="" of="" “test="" 1.in”="" as="" input.="" i="" highly="" recommend="" that="" you="" use="" this="" approach="" to="" help="" save="" tests="" and="" time.="" the="" first="" line="" of="" input="" contains="" a="" single="" integer="" n="" indicating="" the="" number="" of="" aircraft="" that="" will="" arrive="" at="" or="" depart="" from="" the="" airport="" in="" the="" simulation.="" the="" following="" n="" lines="" each="" contain="" information="" for="" a="" single="" aircraft="" entering="" the="" simulation.="" in="" particular,="" each="" aircraft="" will="" include="" 1.="" a="" time="" at="" which="" it="" enters="" the="" simulation="" (int,="" non-negative)="" 2.="" an="" id="" (int,="" unique)="" 3.="" an="" indication="" as="" to="" whether="" it="" is="" departing="" or="" arriving="" at="" the="" airport="" (string,="" either="" “departing”="" or="" “arriving”)="" 4.="" an="" indication="" as="" to="" whether="" or="" not="" an="" emergency="" takeoff="" or="" landing="" is="" required="" (bool,="" “true”="" or="" “false”)="" 5.="" a="" priority="" (int)="" separated="" by="" spaces.="" you="" can="" assume="" that="" this="" information="" is="" in="" sorted="" order="" with="" respect="" to="" the="" times="" that="" the="" aircraft="" enter="" the="" simulation.="" if="" two="" or="" more="" aircraft="" enter="" the="" simulation="" at="" the="" same="" time,="" they="" should="" be="" considered="" in="" the="" order="" in="" which="" they="" are="" given.="" at="" each="" time="" step="" where="" something="" happens,="" your="" program="" should="" print="" information="" to="" the="" screen.="" specifically,="" output="" should="" be="" organized="" as="" follows:="" 2="" time="">

Entering simulation <...> Runway A Runway B Aircraft information should include everything about an aircraft in the same order as the input separated by spaces. Each indentation is a tab. If nothing happens in a particular section, that section should be left empty but the heading should remain. For example, suppose one aircraft enters the simulation and one takes off from runway A at time step 42. Then the output should be Time step 42 Entering simulation 42 10 departing false 5 Runway A 23 4 departing false 2 Runway B If nothing happens in a given time step, nothing should be printed to the screen. 3 Testing As part of this project, you will need to test your code to make sure that the simulation is working as expected. Along with .cpp and .h files, you should submit at least 5 tests with expected outputs and short descriptions of what they test. For example, you might include a test file “test 1.in” that looks like this: 4 0 1 departing false 1 0 2 departing false 1 0 3 departing false 1 0 4 arriving false 3 Along with expected output in “test 1.out”: 3 Time step 0 Entering simulation 0 1 departing false 1 0 2 departing false 1 0 3 departing false 1 0 4 arriving false 3 Runway A 0 1 departing false 1 Runway B 0 4 arriving false 3 Time step 1 Entering simulation Runway A 0 2 departing false 1 Runway B 0 3 departing false 1 A potential description of this test might be “Verifying that runway B is used for takeoffs when no aircraft need to land. Note that aircraft 3 departs from runway B after aircraft 4, the only arriv- ing aircraft, has landed”. Descriptions of test cases can be included in comments at the end your AirportDriver.cpp file. Think carefully about important scenarios that are worth testing! 4 turnin Your code should also be submitted to turnin for testing. The tests that you create should not be taken from turnin. Note that turnin expects a single file called AirportDriver.cpp to be submitted. Any classes you implement, including airplane and priority queue classes, should be included in this single file. This is to accommodate submissions with different class structures. Your code submitted to Blackboard should not be organized in this way. Separate classes should have their own files. 5 Requirements and Grading Your main must be written in a file called AirportDriver.cpp. You must include a binary heap priority queue implementation with the following methods: • empty() - returns true if the priority queue is empty and false otherwise. • size() - returns the number of elements in the priority queue. • push(Object o) - a void method which adds the object O to the priority queue. • pop() - removes and returns the first element of the priority queue. • peek() - returns, but does not remove, the first element of the priority queue. You may use the C++ standard library implementation of a queue in your project if you would like, however, you must implement priority queues from scratch. It is probably a good idea to make an Airplane class of some kind. Your priority queue can be written to work specifically with objects of this type. 4 https://www.cplusplus.com/reference/queue/queue/ Grading for this project will be broken down as follows: • (75 pts) A priority queue implementation with the functionality described above. • (75 pts) A working simulation of a two-runway airport as described above. • (30 pts) At least 5 test cases with expected outputs and brief descriptions as described above. These tests should be well thought out and should cover important aspects of the simulation. • (10 pts) Comments describing functions and important chunks of code. • (10 pts) Organization. 5 1 The Simulation 2 Input and Output 3 Testing 4 turnin 5 Requirements and Grading