Greedy Algorithm Activity Selection doubt

Hello, I am having a small problem in Activity Selection Problem using greedy algorithm.
How do we decide between two activities having same finish time but different start times?
for eg.
1->3 2->3 3->4

Then which activities would be done?

I think you can chose any of them answer would be same , since greedy approach only depends upon the end time so(in this case) it doesn’t matter which one you start with.