Implementation:
You will simulate air trac by continuously updating the position of each aircraft. You may assume that
aircrafts arrive within your surveillance area with a constant arrival rate and that their course and speed
remain constant. Airplanes travel at speeds between 100 and 1000 knots. Once an aircraft leaves your surveillance
area, you are no longer responsible for it. You will implement three dierent surveillance algorithms
which run in O(n2), O(n log2n) and O(n log n), respectively.
1. Simulate the arrival at, travel thru and departure of aircraft from your area of surveillance.
2. Implement the straightforward closest pair algorithm which runs in O(n2).
3. Implement an improved closest pair algorithm which runs in O(n log2n).
4. Implement the fastest closest pair algorithm which runs in O(n logn).
5. Implement the concurrent air trac simulation and surveillance.