Given a set of activities with start and end times, select the maximum number of activities that don$$t overlap.

Example Input: A $=[(0,6),(3,5),(5,7),(2,14),(5,9),(6,10),(8,11),(8,12),(12,16),(1,4)],$ n $=10$ Output $($for the example input$)$: $[(1,4),(5,7),(8,11),(12,16)]$ It turns out that one can come up with a more efficient solution by examining a reordering of the input activities. The sooner an activity ends, the more space there is in our schedule to accommodate more activities. Using this idea, write down the pseudocode for the specified activity selection problem that is more efficient than the brute$-$force method