The peaceful snow-capped valley of "Apocalypse Peaks is under attack! 'Destroyah, the dreaded Kaiju is closing in and you, as the Commander of the World Monster Combat Squad, are responsible for the safety of the valley. Unfortunately, you have only enough funds to employ a single Field Cannon as part of your defense strategy! The people of the village have built m' miniature tunnels through which they diligently supply snowball projectiles up to the Cannon. Each of these snowballs are given a tunnel-entry time (the time at which they are inserted into the tunnel) and the corresponding tunnel number. The only catch being, the radiations from 'Destroyah' cause these snow projectiles to melt soon and therefore, you must launch these projectiles in first-come-first-serve order, through the cannon. Your job is to design a strategic algorithm that will quickly utilise all these snowballs in launching an effective attack against the monster and bring it down! Your algorithm can use a setup time of O(m). Following which, you need to launch each snowball in O(log m) time. You would assume each of the 'm' tunnels to be represented by linked-lists. How efficiently can you do this? Justify your running time. The peaceful snow-capped valley of "Apocalypse Peaks is under attack! 'Destroyah, the dreaded Kaiju is closing in and you, as the Commander of the World Monster Combat Squad, are responsible for the safety of the valley. Unfortunately, you have only enough funds to employ a single Field Cannon as part of your defense strategy! The people of the village have built m' miniature tunnels through which they diligently supply snowball projectiles up to the Cannon. Each of these snowballs are given a tunnel-entry time (the time at which they are inserted into the tunnel) and the corresponding tunnel number. The only catch being, the radiations from 'Destroyah' cause these snow projectiles to melt soon and therefore, you must launch these projectiles in first-come-first-serve order, through the cannon. Your job is to design a strategic algorithm that will quickly utilise all these snowballs in launching an effective attack against the monster and bring it down! Your algorithm can use a setup time of O(m). Following which, you need to launch each snowball in O(log m) time. You would assume each of the 'm' tunnels to be represented by linked-lists. How efficiently can you do this? Justify your running time