Recall that in the Activity Selection problem we are given it positive-length intervals beginning and ending at integer values, and we wish to select a largest cardinality subset of interior-disjoint intervals. In this problem we concerned with a greedy strategy for this problem callit Strategy E that 1s different from that covered in class. Strategy E repeatedly selects a shortest interval consistent with prior dioices until no more selections can he made. {a} [3 points} Shoutr that Strategy E can fail to produce an optimal output. {in} (ti Paints} Show, on the other hand, that Strategy H always produces an output within a factor of 2 of optimal