in c++

Workout (Workout 1) Flight Data Part 1 A certain airline is has hired you to help them process, and optimize, their flights. Write a program that: 1. Reads in a series of 10 flight arrival times. These are not grunted to be sorted or ordered. 2. Reports the pair of arrival times that were the closest together among the 10 input flights. That is, report the pair of flight arrival times that has the shortest elapsed time between them. You may find it useful to use one or more arrays to track all the flight times, so that you have them all loaded before trying to find the pair that occurred closest together. Your program should use the functions you created in the past steps! Example: Enter the flight arrivals: 12:03 2:19 3:14 14:21 18:26 7:16 12:56 2:45 3:10 5:15 The times 3:10 and 3:14 were the closest flights with only 0:04 time between (A hint as you test code you can copy the program input and paste them right into your program in most environments. This will save you some tedious typing.) When you complete this part, have a TA check your work before you go on to the next