Club C1 C2 C3 C4 C5 C6 C7 C8 C9 Start (a) 1 0 2 2 3 4 5 7 6 End (b) 2 3 3 5 6 7 7 10 11 Describe how you would solve thi

[answerhappygod]

Club
C1
C2
C3
C4
C5
C6
C7
C8
C9
Start (a)
1
0
2
2
3
4
5
7
6
End (b)
2
3
3
5
6
7
7
10
11
Describe how you
would solve this specific instance of the problem using dynamic
programming and your recurrence relation from part (a). Don't
actually solve it using this approach, just describe your general
strategy. Explain why you would not necessarily want to solve
this problem in this manner (i.e., in general, assuming there are n
clubs scheduling time in the interval [0..m], think of how big
would your solution matrix have to be).