Greedy Algorithms Introduction Problem:

Given a list of activities with their start and finish times:

Activities: $($ A $=[(1,4),(3,5),(0,6),(5,7),(3,8),(5,9),(6,10),(8,11),(8,$

$12),(2,13),(12,14)]),$

find the maximum number of non$-$overlapping activities.