7(7%): You are given n movies with their start and finish times. Select the maximum number of movies that can be watched by a single person, assuming that a person can only watch a single movie at a time. (Movies' times may overlap). c. Your friend suggested the following wrong greedy algorithm, show him why he is wrong: Pick the shortest movie first, repeat for all non- overlapping movies. [2 points] d. Give a correct greedy heuristic for the above problem. [5 points]