$2\mathrm{.}1$ Create a file Main.java in which to write your code for this question.

$2\mathrm{.}2$ Write code for a main method to build a Min Heap from the data in flights.txt

You will need to write code that performs String pre$-$processing. This means transform

the raw data into the appropriate Node attributes and calculate the arrival time, before

creating a Node and adding it to the Heap. The heap should be ordered by arrival time.

$2\mathrm{.}3$ In the main method, print out the order in which incoming flights should land Sample data: flights.txt

registration$\_$no$,$ departure$\_$timestamp, flight$\_$duration $($hh:mm:ss$)$

ZA$7117,14$:$01$:$36,3$:$33$:$22$

ZA$3642,18$:$06$:$20,5$:$33$:$59$

ZA$5453,23$:$43$:$56,4$:$21$:$13$

ZA$0559,16$:$09$:$05,8$:$58$:$24$

ZA$6903,13$:$54$:$48,11$:$59$:$58$

ZA$9604,12$:$29$:$53,9$:$09$:$07$

ZA$5348,2$:$59$:$13,6$:$23$:$48$

ZA$3835,8$:$42$:$41,14$:$55$:$44$

ZA$4949,12$:$42$:$13,3$:$05$:$13$

ZA$2951,23$:$40$:$10,8$:$05$:$41$

ZA$4940,9$:$11$:$30,12$:$25$:$47$

ZA$3121,4$:$42$:$50,7$:$53$:$03$

ZA$6470,22$:$59$:$30,10$:$03$:$19$

ZA$4981,19$:$37$:$53,12$:$58$:$38$

ZA$0647,9$:$19$:$03,14$:$50$:$22$ Give me a code that runs with all the methods

ZA$5632,12$:$23$:$53,1$:$46$:$22$

ZA$2321,20$:$46$:$09,5$:$07$:$25$

ZA$3408,22$:$48$:$49,1$:$17$:$55$

ZA$2851,4$:$28$:$12,13$:$45$:$53$

ZA$7759,18$:$35$:$41,4$:$25$:$57$