Let S $=\{$A$1,...,$ An$\}$ be a set of weighted activities and each activity A in S has a pos$-$

itive integer value w$($A$).$ The problem is to select a subset of activities with a maximal

total sum of weights from S such that all of the selected activities are compatible $($non$-$

overlapping$)$ with each other. For the following instance of the Weighted Activity Selection

problem

A A$1$ A$2$ A$3$ A$4$ A$5$

s$($A$)04269$

f $($A$)3581011$

w$($A$)53643$

construct a decision tree with divide and conquer technique. Explain how this tree will

be changed if you will apply the recursive algorithm with memorization technique