Busy Man question in Greedy Algorithm

#1

Will the time complexity of code will be O(n log n) where n is the number of activities?

#2

hello @Sakshi2004

it will depend on ur implementation.
pls share ur code with me.

#3
#4

yeah its nlogn because of sorting