How would you explain solved exercise 2 of chapter 3 of "Algorithm Design" by Eva Tardos? I have this project in algorithms and it requires to me find the time complexity of 2 job scheduling algorithms. Can anyone explain it to me?