In C++

You may use any language you choose to implement the activity selection last-to-start algorithm described in problem 3. Include a verbal description of your algorithm, pseudocode and analysis of the theoretical running time. You do not need to collected experimental running times The program should read input from a file named "act.txt". The file contains lists of activity sets with number of activities in the set in the first line followed by lines containing the activity number, start time & finish time Example act.txt: 114 2 3 5 3 0 6 4 5 7 5 3 9 65 9 7 6 10 8811 9 8 12 10 2 14 11 12 16 36 8 17 9 2 12 In the above example the first activity set contains 11 activities with activity 1 starting at time 1 and finishing at time 4, activity 2 starting at time 3 and finishing at time 5, etc.. The second activity set contains 3 activities with activity 3 starting at time 6 and finishing at time 8 etc. The activities in the file are not in any sorted order Your results including the number of activities selected and their order should be outputted to the terminal. For the above example the results are Set 1 Number of activities selected Activities: 249 11 4 Set 2 Number of activities selected 2 Activities: 21