Prove that the following greedy approaches to the activity selection problem fail to produce a maximum$-$size set of mutually compatible activities.a$)$ Always select the compatible activity that overlaps the fewest other remaining activities.