Works correotly,

$($b$)$ Deline thi Activity Solection Problem. Solve the problem using Dynamic Proeramming

approach proceed as follows:

Deline the activity selection problem in the form of what input it takes and the

oripubicprodiwes.

$1$i$.$ Give the optimal substructure of your solution and prove its correctness.

iii. Clearly state what to memorize and how.

iv$.$ Design the algorithm based on your optimal substructure and analyze its running

timer

V$.$ Is the dynamie programming solution betier than the Greedy solution in terms of

time$/$space complexity?