Question about the greedy algorithm:

Determine an optimal solution to the activity selection problem using the greedy algorithm. for the following problem instance. Each triple is of the form (task U, start-time, end-time). Problem instance: {(1, 4, 5), (2, 3, 6), (3, 2, 5), (4, 5, 81(5, 8, 9)}